Multiple choice

The cube root of a natural number n is defined as the largest natural number m such that m3 $\le$n. The complexity of computing the cube root of n (n is represented in binary notation) is

  1. O(n) but not O(n0.5)

  2. O(n0.5) but not O((log n)k) for any constant k > 0

  3. O((log n)k) for some constant k > 0, but not O((log log n)m) for any constant m > 0

  4. O((log log n)k) for some constant k > 0.5, but not O((log log n)0.5)
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Keep practicing — related questions