Big O is also known as the algorithm's upper bound since it analyses the worst-case situation. The best-case scenario usually tells us nothing — we'll possibly solve the problem on the first try.