HN
Hacker News
Top
New
Best
Ask
Show
Jobs
Comment by andromeduck | Hacker News Reader
Parent
Full thread
andromeduck
·
O(log n) vs O(1)
View on HN
ryanschaefer
·
Is there a way to keep a list with changing values sorted in real time in order to use a log n search algorithm?
andromeduck
·
It's log n either way.
throw_pm23
·
Yes, a binary search tree that is dynamically balanced, for example red-black or avl.
Reply on news.ycombinator.com