In order to choose which algorithms to use in specific situations, it is crucial to take time efficiency into account. Before studying algorithms, firstly take a closer look at how to quantify and characterise the efficiency of algorithms. In this article we are going to discuss Time vs Space Complexity, Average time vs Best time Complexity and Examples of Big O notation.

Full Article Available on https://hecodesit.com/examples-of-big-o-notation/