- Executors
-
Learn
Learn Python Runnable examples, NumPy, pandas, and more Learn AI / Machine LearningNeural networks, ML and LLMs from scratch Learn C & C++ Pointers, memory, STL, and modern C++ Learn C#C# basics, OOP, LINQ, async, and .NET exercises Learn MatplotlibLine, bar, scatter and pie charts with live visualizers Learn RustOwnership, traits, error handling, and threads Learn GoSlices, interfaces, goroutines, and channels Python Algorithms Search, sorting, recursion, and visualizers O(n) C & C++ Algorithms Compare algorithms implemented in C and C++ Coding for Kids Learn to code by playing!
- QuizzesNew
- ChallengesNew
- For TeachersNew
- Updates
- Buy me a coffee
Python Recursion Quiz
This Python recursion quiz asks you to trace recursive functions, count calls and find the bugs that break them. It is good practice for coding interviews, with questions on base cases, RecursionError and the cost of naive recursion.
Sample question
Question 1 of 10What does this print?
def fact(n):
if n <= 1:
return 1
return n * fact(n - 1)
print(fact(5))
Show the answer
A. 120 fact(5) is 5 * 4 * 3 * 2 * 1. The base case stops at 1, so the chain of calls multiplies back up to 120.
What this quiz covers
- Base case and recursive case
- The order of work before and after a recursive call
RecursionErrorand the recursion limit- How many calls naive Fibonacci makes
- Common bugs like a missing
returnor a shared default list
Questions people ask
Do I need an account?
No. Anyone can play. Sign in to keep your XP, streak, badges and history.
Which Python version?
Python 3.12. Every question about output was checked by running the code.
Can I retake it?
Yes. Your best score is kept, and the questions and answers are shuffled each time.