GATE | GATE-CS-2003 | Question 66

The cube root of a natural number n is defined as the largest natural number m such that m³ ≤ n. The complexity of computing the cube root of n (n is represented in binary notation) is:
(A) O(n) but not O(n^0.5)
(B) O(n^0.5) but not O((log n)^k) for any constant k > 0
(C) O((log n)^k) for some constant k > 0, but not O ((log log n)^m) for any constant m > 0
(D) O((log log n)^m) for some constant k > 0.5, but not O((log log n)^0.5)

Answer: (C)
Explanation: Refer http://stackoverflow.com/questions/20767702/complexity-to-find-cube-root-of-n
Quiz of this Question