Pro lesson · Preview

Recursion

A function that calls itself. The base case, the recursive case, the call stack, and the question of when to use recursion vs a loop.

20 min read

This lesson is part of Pro

Upgrade to unlock the full lesson and the complete interview Q&A.

Unlock with Pro

5 interview questions on this topic

Each one opens a full worked answer.

What are the two parts every recursive function needs?How does the call stack work during recursion?When should you use recursion instead of a loop?What is tail recursion, and why might it not matter in C?Naive recursive Fibonacci is O(2^n). Why?

This is just the start

Sign up free to track your progress through this course, mark lessons complete, and work through the full interview Q&A.

Sign up freeSee pricing

More in Programming Fundamentals

What Is a Program?Variables & Data TypesOperators
Input & Output
Conditionals
The switch Statement
Recursion | EmbeddedPrep.io