Algorithms | Divide and Conquer | Question 5

Last Updated :
Discuss
Comments
Consider a situation where you don't have function to calculate power (pow() function in C) and you need to calculate x^n where x can be any number and n is a positive integer. What can be the best possible time complexity of your power function?
O(n)
O(nLogn)
O(LogLogn)
O(Logn)

This question is part of this quiz :

Top MCQs on Divide and Conquer Algorithm with Answers
Tags:
DSA Quiz
Share your thoughts in the comments