Job Updates
Interviews
Connect
Connect & get Notified

Power of Number Using Recursion

Power of Number

Definition & Explanation

Example:
Input:
Output:

More Description

Heading

Desc

C

Method 1 :

#include <stdio.h>

int power(int a, int b) {
    if (b != 0)
        return a * power(a, b - 1);
    else
        return 1;
}

int main() {
    int a = 2;
    int b = 3;
    printf("Power of Number is %d\n", power(a, b));
    return 0;
}

Output :

C++

Method 1 :

#include <iostream>
using namespace std;

int power(int a, int b) {
    if (b != 0)
        return a * power(a, b - 1);
    else
        return 1;
}

int main() {
    int a = 2;
    int b = 3;
    cout << "Power of Number is " << power(a, b) << endl;
    return 0;
}

Output :

JAVA

Method 1 :

public class Main {
    public static int power(int a, int b) {
        if (b != 0)
            return a * power(a, b - 1);
        else
            return 1;
    }

    public static void main(String[] args) {
        int a = 2;
        int b = 3;
        System.out.println("Power of Number is " + power(a, b));
    }
}

Output :

Python

Method 1 :

def power(a,b):
	if b!=0:
		return a*power(a,b-1)
	else:
		return 1

a=2
b=3
print("Power of Number is ",power(a,b))

Output :

Power of Number is  8
View All Codes