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


+ Recent posts