Big O Notation

Standard notation of time complexity

We know how we can represent any algorithm through the order of $n$ or input. Big O notation is the most convenient way to express the worst-case scenario for an algorithm.

Consider a code where we use the sqrt(Range) algorithm. The Big O notation is $O(\sqrt{n})$ for this case. This algorithm couldn’t be worse than anything.

Consider another code where we have to iterate over one million times if $n$ is 1000003. The Big O notation is $O(n)$ for this case, which is the worst-case scenario in this case.

Now, comparing these two worst-case scenarios, we can safely say that the algorithm of the former is better than the latter.