Algorithm & Design
Notations for complexity
(A) Asymptotic Notations (n→∞): Asymptotic notations are used to express the running time of an algorithm in terms of function, whose domain is the set of natural numbers N={1,2,3,…..}. Such notations are convenient for describing the worst case running time function T(n). Asymptotic notation gives the rate of growth, i.e. Read more…