Breaking News: Grepper is joining You.com. Read the official announcement!

power of number using recursion

isuro answered on February 3, 2023 Popularity 6/10 Helpfulness 1/10

answer power of number using recursion

related power of number using recursion

power of number using recursion

Comment

//Efficient m power n using recursion
#include <iostream>
using namespace std;

int power(int m, int n){
    if(n == 0){
        return 1;
    }else if(n % 2 == 0){
        return power(m*m, (n/2));
    }else{
        return m*power(m*m, (n-1)/2);
    }
}

int main() {
    int base, expo;
    cout << "Enter Your Base: " << endl;
    cin >> base;
    cout << "Enter Your Exponent: " << endl;
    cin >> expo;
    
    cout << base << "^" << expo << " is = " << power(base,expo);
    
    return 0;
}

Popularity 6/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++ recursion using

Link to this answer
Share Copy Link

Contributed on Feb 03 2023

isuro

0 Answers Avg Quality 2/10

Closely Related Answers

power of number using recursion

Comment

//Basic m power n using recursion
#include <iostream>
using namespace std;

int power(int m, int n){
    if(n == 0){
        return 1;
    }else{
        return power(m, (n-1))*m;
    }
}

int main() {
    int base, expo;
    cout << "Enter Your Base: " << endl;
    cin >> base;
    cout << "Enter Your Exponent: " << endl;
    cin >> expo;
    
    cout << base << "^" << expo << " is = " << power(base,expo);
    
    return 0;
}

Popularity 5/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: using c++ recursion

Link to this answer
Share Copy Link

Contributed on Feb 03 2023

isuro

0 Answers Avg Quality 2/10

power of number using recursion

Contents

More Related Answers

power of number using recursion

Closely Related Answers

power of number using recursion

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.