notes

Asymptotic notation represents the rate-of-growth of the running time of an algorithm as the algorithm's input size n becomes large. To find asymptotic notation, we express the number of steps in an algorithm