OP here - Big O notation is simply shorthand math. When you're discussing things in this way, time complexity and performance are the same thing. When you care about resource usage (memory etc) that's space complexity, which is different. Either way, they're good things to understand.
>So no I don't think you should use an O(log n) operation in place of an O(n) operation just because of Big O, what matters is which one is faster.
Mathematically the log n is always faster :). Realistically... well that would be a tough one to prove, even with caching, but I say go for it.
>So no I don't think you should use an O(log n) operation in place of an O(n) operation just because of Big O, what matters is which one is faster.
Mathematically the log n is always faster :). Realistically... well that would be a tough one to prove, even with caching, but I say go for it.