Consider the following two functions:

void fun1(int n) {
if (n == 0) return;
printf("%d", n);
fun2(n - 2);
...

Question

Consider the following two functions:

void fun1(int n) {
    if (n == 0) return;
    printf("%d", n);
    fun2(n - 2);
    printf("%d", n);
}
void fun2(int n) {
    if (n == 0) return;
    printf("%d", n);
    fun1(n - 1);
    printf("%d", n);
}

The output printed when fun1(5) is called is:

A. 5 3 2 2 3 5
B. 5 3 1 1 3 5
C. 5 3 2 3 5
D. 5 3 1 3 5

Accepted Answer

The output printed when fun1(5) is called is 5 3 2 2 3 5 — option A. fun1 and fun2 are mutually recursive functions. fun1(n) prints n, calls fun2(n-2), then prints n again. fun2(n) prints n, calls fun1(n-1), then prints n again. The recursion terminates when n reaches 0. Each function prints its n both before and after the recursive call, creating a palindrome-like output pattern.