Ordering Growth Rates

If f is not O(g) but f is O(h) ,then g is strictly asymptotically dominated by h

O(g) < O(h)

O(1) < O(log n) < O(log2 n) < O(n) < O(n log n) < O(n2) < O(n3) < O(nk) < O(1.1n) < O(2n) < O(3n) < O(n!) < O(nn)

Previous slide

Next slide

Back to first slide

View graphic version