I am learning algorithm analysis. I am having trouble understanding the difference between O, Ω, and Θ.
The way they\'re defined is as follows:
<
Θ denotes an asymptotically tight upper and lower bound.
O denotes an upper bound, but this bound might or might not be tight. o denotes an upper bound that is not tight.
Ω denotes a lower bound, but this bound might or might not be tight. ω denotes a lower bound that is not tight.