Please answer my Algorithms question and explain with steps
What is the recurrence of the power2() function (source codebelow)? What is its running time? Is it faster than the iterativeway (power) ?
int power(int base, int n){ int result = 1; for (int i = 1; i <= n; i++) { result *= base; }
PayPal Gateway not configured
PayPal Gateway not configured