resto de division recursiva

#include <stdio.h>

int recursiveModulo(int dividend, int divisor);

int main() {
    int dividend, divisor;

    // Input values
    printf("Enter dividend: ");
    scanf("%d", &dividend);
    printf("Enter divisor: ");
    scanf("%d", &divisor);

    // Check if divisor is not zero
    if (divisor != 0) {
        int result = recursiveModulo(dividend, divisor);

        // Output result
        printf("Result of %d %% %d is %d\n", dividend, divisor, result);
    } else {
        printf("Error: Division by zero\n");
    }

    return 0;
}

int recursiveModulo(int dividend, int divisor) {
    // Base case: when dividend is less than divisor, return dividend
    if (dividend < divisor) {
        return dividend;
    } else {
        // Recursive case: subtract divisor from dividend and call the function again
        return recursiveModulo(dividend - divisor, divisor);
    }
}