Hacker News Reader

> But to be more specific we could say this is worst case O(n) and best case O(1) runtime.

Those should really say θ(n) and θ(1).

That first one should be a big O.

Hmm. Big O already encompasses "at worst".

Theta is the notation for a single case, be it the worst case, the best case, one run of a randomized algo, etc.

At least that is my understanding.

Big O is an upper bound, little o is a lower bound. Big theta means both an upper and lower bound.