Question

Please implement it using recursion and it would be great if you could provide test code as well. Thanks.

1) Implement exponentiation recursively based on the following mathematical facts , if n = even number m" = 2 1-1 1-1 n-1 2 mxm т × m T = m × (mT) If n = o a a number , You can assume n is a non-negative integer. int expo(const int m, const unsigned int n)

Answer 1

#include <stdio.h>

int expo(const int m, const unsigned int n);

int main() {
    int base, power;
    printf("Enter base: ");
    scanf("%d", &base);
    printf("Enter power: ");
    scanf("%d", &power);
    printf("%d power %d is %d\n", base, power, expo(base, power));
    return 0;
}

int expo(const int m, const unsigned int n) {
    if (n == 0) {
        return 1;
    }
    int result = expo(m, n/2);
    if (n % 2 == 0) {
        return result * result;
    } else {
        return result * result * m;
    }
}