0 votes 0 votes what is the time complexity of the $pow(m,n)$ ? Algorithms time-complexity algorithms + – vijju532 asked Jun 17, 2018 • edited Jun 19, 2018 by Subarna Das vijju532 399 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply srestha commented Jun 17, 2018 reply Follow Share question need some more information give some example 1 votes 1 votes Arjun commented Nov 9, 2019 reply Follow Share It is about the time complexity of pow function 0 votes 0 votes srestha commented Nov 10, 2019 reply Follow Share So,Pow will be defined somewhere. Pow means, number m will be multiply n times. If we think it like for loop, T.C. will be $O(n)$ right? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes i think power complexity is O(log n) arun yadav answered Sep 24, 2020 arun yadav comment Share Follow See all 0 reply Please log in or register to add a comment.
