KwickClips Python · 40 sec · free
What is the base case for sum of digits?
Short answer. A single digit, n ‹ 10.
How does recursion solve a problem?
Find the simplest case, then shrink the problem.
Base and recursive case
| Program | Base case | Recursive |
|---|---|---|
| factorial | n <= 1: 1 | n * f(n-1) |
| Fibonacci | n <= 1: n | f(n-1)+f(n-2) |
| digit sum | n < 10: n | n%10+f(n//10) |
Remember
| Find the simplest case first |
| Then shrink the problem |
Three classic recursions for tests. Here f is the function and n the number. Factorial stops at one. Fibonacci stops at n, else adds two terms. Digit sum stops at one digit. Find the simplest case. Then shrink the problem.
This clip is from the full lesson: Recursion in Python — 8 minutes, with the tables, the quick answers and the whole lesson in text.
Useful for: Programming All levels Python, Programming All levels C++
More KwickClips from this lesson
How does Python track a function calling itself?39 sec
Why did my recursion never stop?38 sec
What is Python's typical recursion limit?41 secDisclaimer. KwickAcademy is free study material for general learning and revision. Parts of it, including the voice-over, are produced with the help of AI tools and may contain errors; if you spot one, please tell us and we will correct it. Syllabus, marks and exam details follow the latest official board publications available to us, and boards can change them at any time, so always confirm against your board's official website and your school. Using this material does not guarantee any marks or result. Board names and trademarks belong to their owners; Kwickprep is not affiliated with or endorsed by any examination board. We never ask for passwords, OTPs or ID numbers. Your progress is saved only in this browser. Full disclaimer · Privacy