Lately, I have gotten an interest in algorithms, the first one I chose to understand deeply is how sorting algorithms work and their time complexity. However, this post is not to explain sorting algorithms, instead, we will take a step back and understand time complexity [Big O Notation] in the simplest way possible.
Before we go any further, let’s understand what is an Algorithm:
An Algorithm is a step by step instruction, telling a program to execute in a certain way to solve a particular problem. And it’s pretty obvious, that when we run a program in any language,…