Asymptotic Notation

Asymptotic Analysis of an algorithm refers to computing the running time of any operation in mathematical units of computation. We will learn about asymptotic analysis and notation, types of notation: big-o, omega & theta notation and growth rate of algorithm.

Here, We learn about the analysis of loops like O(1), O(n), O(nc), O(log n), O(log log n) and O(m+n) in terms of time complexity and order of growth of functions in the algorithm.