BigO functions
Below are some common BigO functions to analyzing the Algorithms:
O(1) - constant time
O(log(n)) - logarithmic time
O((log(n))c) - polylogarithmic time
O(n) - linear time
O(n2) - quadratic time
O(nc) - polynomial time
O(cn) - exponential time
O(n!) - factorial time
O(1) - constant time
O(log(n)) - logarithmic time
O((log(n))c) - polylogarithmic time
O(n) - linear time
O(n2) - quadratic time
O(nc) - polynomial time
O(cn) - exponential time
O(n!) - factorial time
Topic archived. No new replies allowed.