6851-2017 / Dynamic_Fractional_Cascading Public

Notifications You must be signed in to change notification settings
Fork 0
Star 3

O(log u) query to find the predecessor/successor of O(log u) arrays.

3 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
README.md		README.md
main.cpp		main.cpp

Repository files navigation

Dynamic fractional cascading

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

About

O(log u) query to find the predecessor/successor of O(log u) arrays.

Custom properties

Report repository

Releases

No releases published

Packages

No packages published

Languages

C++ 100.0%