Terminology
Given an algorithm whose running time is T(n)
- T(n) ? O(f(n)) if there are constants c and n0 such that T(n) ? c f(n) for all n ? n0
- T(n) ? ?(f(n)) if there are constants c and n0 such that T(n) ? c f(n) for all n ? n0
- n, n2, 100 . 2n, n3 log n ? ?(n)
- T(n) ? ?(f(n)) if T(n) ? O(f(n)) and T(n) ? ?(f(n))
- n, 2n, 100n, 0.01 n + log n ? ?(n)
- T(n) ? o(f(n)) if T(n) ? O(f(n)) and T(n) ? ?(f(n))
- T(n) ? ?(f(n)) if T(n) ? O(f(n)) and T(n) ? ?(f(n))
- n1.01, n2, 100 . 2n, n3 log n ? ?(n)