OptimizedPowerRecursion

#include<iostream>
using namespace std;

int optimizedPowerRecursion(int a,int b)
{
    //base case 
    if(b==0)
    {
        return 1;
    }
    if(b==1)
    {
        return a;
    }

     //recurrence relation
    int ans=optimizedPowerRecursion(a,b/2);

    if(b&1==1)
    {
        return a* (ans*ans);
    }
    else 
    {
        return ans*ans;
    }

   
}

int main()
{
    int a;
    cout<<"Enter the number you want to find power of"<<endl;
    cin>>a;

    int b;
    cout<<"Enter the power you want to find of number"<<endl;
    cin>>b;

    cout<<"the power of given number is"<<endl;
    cout<<optimizedPowerRecursion(a,b);

}