Recursion: Find the Base and Exponenet

//Use CodeBlocks Studio version 1.0. 

#include <iostream>
using namespace std;

int power(int base, int exponent) {

      if ( exponent < -1)
          return (1/base) * power(base, exponent+1);

     else if (exponent == -1 )
          return (1/base);

     else if (exponent == 0 )
          return 1;
     else if (exponent == 1 )
           return base;
     else
          return base * power(base, exponent-1);
     int result = base;

}
    int main(){
        int number = 0;
        int number2 = 0;
        cout<<”enter number(base): “;
        cin>>number;
        cout<<”enter number(exponent): “;
        cin>>number2;
    for(int x = 1;x<=number2; x++){
    cout<<endl;
    cout<<number<<” raised to the power of “<<x<<” : “<<power(number,x)<<”\n”;
    }
    return 0;
    }