C Recursion Quiz

This C quiz tests recursion, functions that call themselves. You will trace calls step by step, see how printing before or after the recursive call changes the output, and pick correct base cases.

Medium 10 questions ~6 minutes Pass at 80% C17

Choose a mode

Playing as a guest: sign in to keep your XP and streak.

Sample question

Question 1 of 10

What does this print?

#include <stdio.h>

int fact(int n) {
    if (n <= 1) return 1;
    return n * fact(n - 1);
}

int main(void) {
    printf("%d\n", fact(5));
    return 0;
}
Show the answer

D. 120 fact(5) is 5 * 4 * 3 * 2 * 1 = 120; the recursion stops at the base case n <= 1. 24 is fact(4) and 15 is 5 + 4 + 3 + 2 + 1.

What this quiz covers

  • Base case and recursive case
  • Tracing factorial, Fibonacci and digit sums
  • Work done before vs after the recursive call
  • Counting calls in naive Fibonacci
  • Stack frames and mutual recursion

Questions people ask

Do I need an account?

No. Anyone can play. Sign in to keep your XP, streak, badges and history.

Can I retake it?

Yes. Your best score is kept, and the questions and answers are shuffled each time.