<ul><li>AN are mathematical functions that are used to calculate running time and rate of growth of an algorithm.</li><li>Order of growth of computing time: logN, N, NlogN, N^2, 2^n.</li><li>Factors affecting running time: Speed of computer, compiler used, programming language, algorithm of choice, types and size of input/output.</li><li>Constants are ignored to focus on algorithm performance for larger values of input.</li><li>Types of Asymptotic Notations: Big O (worst case), Big Omega (lower bound), Bit Theta (average case).</li></ul>

Chapter 4: Asymptotic Notations

Discover more