Have you ever heard people talk about the big 'O' of an algorithm? Well, I certainly have done. Let's distil it down in this short post.
The Big 'O' notation is just a way to estimate the running time or space complexity of a problem. It is used by Computer Scientists to estimate the running time and cost of an algorithm. It may be in terms of time, space or something like that. The Big 'O' specifically takes the worst case scenario that the particular algorithm can face.
Let's say that we are searching a word in a dictionary. We may arbitrarily search each page until we find the word. If the no. of pages in the book is say
n pages long. It would take us
n steps to find a solution in the worst case. Or if you are searching 2 pages at a time then it would be n/2 steps. This algorithm by the way is called Linear Search. This is represented as the
O(n). For simplicity, we trim of the /2 because we only focus on the main variable. The actual thing may be say
n - 1,
2n etc. and would still be counted as
O(n). This is as David here, put it, a wave of the hand.
What if you searched through the same dictionary. But this time, start from the middle and start splitting the book. Like open at somewhere near
M then see if the letter you need is on the left or right. Again open in the middle of that half of the book and repeat. This would be represented as
O(log n), or logarithmic complexity.
So, this was all. Thank you for reading. See ya later!