Given O(log u) arrays, performs predecessor/successor query on all of them on a single key in O(log u) time.
O(log u) update per array.
Associated co-author post: https://coauthor.csail.mit.edu/6.851-2017/m/PcB2JmekhLuTAb4qs
-
Notifications
You must be signed in to change notification settings - Fork 0
6851-2017/Dynamic_Fractional_Cascading
About
O(log u) query to find the predecessor/successor of O(log u) arrays.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published