In my last blog post, I wrote about time complexity.
In summary, time complexity is a way to determine the efficiency or inefficiency of an algorithm by determining the maximum number of steps that it will take to execute an operation on a given input.
However, the Big O notation used to describe time complexity, will not always tell you the fastest algorithm. In fact, in certain use cases, it may actually imply a slower solution.
Let's start with one of the fundamental rules of big O notation: