Analysis of Algorithms

Big-O

Take 2 – Bottom-Up Approach

Context for Big-O

Best/Worst/Average case

More Examples

O(log n)

Subtleties

Formalities

Monday 29 June

Exponential: constant^n (where n describes input size) Polynomial: n^constant (exponent is constant)