Comment by ryanschaefer
2 years ago
Is there a way to keep a list with changing values sorted in real time in order to use a log n search algorithm?
2 years ago
Is there a way to keep a list with changing values sorted in real time in order to use a log n search algorithm?
Yes, a binary search tree that is dynamically balanced, for example red-black or avl.
It's log n either way.