Efficient 10 power x algorithm

Question

Can anyone help me with finding an efficient code to find 10 power x?

 private int power(int base, int exp)
{
    int result = 1;
    while (exp != 0)
    {
        if ((exp & 1) == 1)
            result *= base;
        exp >>= 1;
        base *= base;
    }

    return result;
}

Source of code from here, but I am looking for a way where the input could be 3.14 (double). I also cannot use any library functions. The power can be a real number. So it is not just a simple integer algorithm where we can find by Exponentiation by Squaring.

Answer 1

Why dont you use Math.pow(double, double)

you can even check out the source.

---