알고리즘 & 자료구조/알고리즘&자료구조
Time complexity , Big O notation
3DMP
2018. 5. 14. 07:41
Time complexity, Big O notation
O(1) < O(log n) < sqrt(n) < O(n) < O(nlogn) < O(n^2) < O(2^n) < O(n!)
ref : https://en.wikipedia.org/wiki/Time_complexity
반응형