Big O notation is used to classify algorithms based on how their execution time or space requirements grow as the size of the input increases. Big-O notation can express the best, worst, and average execution time of an algorithm. Knowledge of Big O is an essential tool when working with algorithms that must operate at a large scale.
Sort: