The cube root of natural number n is defined as the largest natural number m such that m^3 <= n. The complexity of the computing the cube root of n (n is represented in binary notation) is (Pls note that the symbol ^ stands for power, for ex. m^3 means m to the power 3 or m cube)
Options: A) O((log n)^k) for some constant k > 0, but not O((log log n)^m) for any constant m > 0 B) O((log log n)^k) for some constant k > 0.5, but not O((log log n)^0.5) C) O(n) but not O(n^0.5) D) O(n^0.5) but not O((log n)^k) for any constant k > 0 Help me to find the answer for this problem. With Regards D. Dayal -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
