Answer to Question #260075 in Algorithms for anju

Question

Arrange the following growth functions in increasing order of growth:

       O(n1.5), O(2n), O (nlogn), O(logn), O(n3),  O() ,O(),O()

Answer 1

The given growth function,

$O(n^{1.5}), O(2n), O (nlogn), O(logn), O(n^3)$

Again,

$O(n^{\frac{3}{2}}), O(2n), O (nlogn), O(logn), O(n^3)$

Now,

As we know that, big O notation provides the upper bounds to the function,

$O(n^3)>O(n^{\frac{3}{2}})>O(2n)>O(\log n^n)>O(\log n)$