Question: What is the complexity of the below code? int pow(int m, int n) { int ret = 1; int k = m; int i
What is the complexity of the below code? int pow(int m, int n) { int ret = 1; int k = m; int i =n; while (i > 0) { if (i % 2 == 1) ret *= k; k*=k; i/= 2; return ret; Your answer: O 0(n) O O(log n) OO(n) Oo(m) logo M
Step by Step Solution
There are 3 Steps involved in it
The complexity of the given code to calculate the p... View full answer
Get step-by-step solutions from verified subject matter experts
