PA of Algorithms Q36

0. 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

Answer
Comment
Array

Option : C
Explanation :
Use binary search in the array of number from 1 ........ n to check cube of the number matches n (i.e. a[i]* a [i]* a [i] = = n). option (C) is true

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.