Algorithm Analysis

Runtime Analysis of an Algorithm:

The fastest possible running time of any algorithm is O(1), commonly referred to as Constant Running time. In this case algorithm takes same amount of time to execute, regardless of the input size.

n – input size