Big O notation

Classification of algorithms running times given input X as X grows very large.

Smallest to Largest:

O(1) Constant

O(log n) Logarithmic

O(n^c) Fractional power, 0< c < 1

O(n) Linear

O(n log n) Linearithmic, O(n log n!)

O(n^2) Quadratic

O(n^x) Polynomial, x > 2

O(c^x) Exponential, c > 1

O(n!) Factorial