basics · beginner · ~15 min

Integer power recursively

Use the exponent's recurrence b^e = b * b^(e-1).

Challenge

Implement long int_power(int base, int exp) computing base^exp for exp >= 0, using recursion. int_power(b, 0) == 1.

Starter code

long int_power(int base, int exp) {
    /* TODO */
    return 1;
}

Solve this exercise in the browser editor — compile and run against the test harness, no setup required.