카테고리 없음
Big O Definition
아빠악어.
2017. 3. 5. 00:23
English Definition
- usually, the worst running time of an algorithm
Mathmatic definition
- T(n) = O(f(n)) If and only if there exist constans c, n0 > 0 such taht
T(n) <= cf(n) for all n >= n0
Omega
- cf(n) <= T(n)
Theta
- c1f(n) <= T(n) <= c2f(n)
- https://www.coursera.org/learn/algorithms-divide-conquer/lecture/KGtUp/big-oh-notation
- https://xlinux.nist.gov/dads/HTML/bigOnotation.html