[andromeduck]

O(log n) vs O(1)

[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?

[throw_pm23]

Yes, a binary search tree that is dynamically balanced, for example red-black or avl.

[andromeduck]

It's log n either way.