Lesson 20
Unlock this lesson
Create a free account, then buy the course to open every lesson.
What you will learn in this lesson
- What recursion is: a function that calls itself.
- The two parts every recursive function needs: a base case and a recursive case.
- Find a factorial, the sum of digits, Fibonacci numbers and a power with recursion.
- Follow the calls going in and the answers coming back.
- What happens when the base case is missing.
Everything in C Programming: BCA, MCA, BTech & O Level
- 37 step-by-step lessons
- 10 mini projects with solutions
- A final project for your portfolio
- Real commands and real output in every lesson
- Practice task with a solution in each lesson
- Progress saved to your account