Asymptotic order of growth A way of comparing functions that ignores constant factors and small input sizes(because?) n O(g(n): class of functions f(n)that grow no faster than g(n) n o(g(n): class of functions f(n) that grow at same rate as g(n) n 2(g(n): class of functions f(n) that grow at least as fast as g( Copyright 2007 Pearson Addison-Wesley. All rights reserved A Levitin "Intoducion to the Design Analysis of Algorithms, 2nd ed, Ch 2 2-10Copyright © 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin “Introduction to the Design & Analysis of Algorithms,” 2 nd ed., Ch. 2 2-10 Asymptotic order of growth A way of comparing functions that ignores constant factors and small input sizes (because?) O(g(n)): class of functions f(n) that grow no faster than g(n) Θ(g(n)): class of functions f(n) that grow at same rate as g(n) Ω(g(n)): class of functions f(n) that grow at least as fast as g(n)