1. UMass Lowell Computer Science 91.404 Analysis of Algorithms Prof. Karen Daniels Fall, 2006 Text: Chapter 3 Growth of Functions

2. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Source: Textbook [Cormen2001] Asymptotic Analysis

3. Math fact sheet (courtesy of Prof. Costello) is on our web site.

4. Function Order of Growth O( ) upper bound  ( ) lower bound  ( ) upper & lower bound n 1 n lg(n) n lg 2 (n) 2n2n2n2n n5n5n5n5 lg(n) lg(n)lglg(n) n2n2n2n2 know how to use asymptotic complexity notation to describe time or space complexity know how to order functions asymptotically (behavior as n becomes large)