数值的整数次方

#include "stdafx.h"
#include <iostream>
#include <exception>
#include <stack>
/*
    题目:实现函数 doublePower(double base,int exponenet),
    求base的exponenet次方,不得使用库函数，同时不需要考虑大数问题
*/
using namespace std;
bool g_InvalidInput = false;
bool equal(double num1,double num2)
{
    if((num1 - num2 >-0.0000001)&&(num1-num2<0.0000001))
    {
        return true;
    }
    else return false;
}
double PowerWithUnsignedExponenet(double base,unsigned int exponent)
{
    double result = 1.0;
    for(unsigned int i = 1;i<=exponent;++i)
    {
        result*= base;
    }
    return result;
}
double Power(double base,int exponent)
{
    g_InvalidInput = false;
    if(equal(base,0.0)&&exponent<0)
    {
        g_InvalidInput = true;
        return 0.0;
    }

    unsigned int absExponent = (unsigned int) (exponent);
    if(exponent<0)
        absExponent = (unsigned int)(-exponent);
    double result = PowerWithUnsignedExponenet(base,absExponent);
    if(exponent <0)
        result = 1.0/result;
    return result;
}

int _tmain(int argc, _TCHAR* argv[])
{ 
    cout<<Power(2,3)<<endl;
    return 0 ;
}