Data-Structures-And-Algorithms/power_of_number_using_recursion.cpp at master · KISHOREMUTHU/Data-Structures-And-Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
# Data-Structures-And-Algorithms
Here I will post my regular DSA problems

// Power of a number without using in - built pow () function
// Recursive method

#include <iostream>
using namespace std;

double power (double a , int n){

        double result = 1;

        if ( n == 0 ){

            return 1 ;

                     }

        else if ( n == 1 ){

            return a;

                          }

        else if( n % 2 == 0 ){

            return power( a , n/2 ) * power( a , n/2 );

                             }

        else{

            return power( a , ( n/2 ) + 1 ) * power( a , n/2 );

            }


        return result;

                             }

int main()
{
    double num , p ,r;
    cout << "Enter number : ";
    cin >> num ;
    cout << "Enter exponent :";
    cin >> p ;

    if(p<0){

        r = power ((1/num),-p);

           }

    else {

          r = power (num , p);

         }

    cout << "The answer is : " << r;
    return 0;

}