Recursion: Conceptual
Recursion gives you a new perspective on problem-solving by defining a problem in terms of itself.
Start
Key Concepts
Review core concepts you need to learn to master this subject
What is Recursion
Base Case of a Recursive Function
Recursive Step in Recursive Function
Call Stack in Recursive Function
Execution Context of a Recursive Function
Weak Base Case in Recursive Function
Big-O Runtime for Recursive Functions
What is Recursion
What is Recursion
Recursion is a strategy for solving problems by defining the problem in terms of itself. A recursive function consists of two basic parts: the base case and the recursive step.
Recursion: Conceptual
Lesson 1 of 1
- 1You’ve heard about a trendy new spot that sells fruit sandwiches. What are fruit sandwiches? You have no idea, but you’re eager to find out! Sadly, when you arrive at the store, the line is out t…
- 2Recursion is a strategy for solving problems by defining the problem in terms of itself. For example, to sum the elements of a list we would take the first element and add it to the **sum of t…
- 3A recursive approach requires the function invoking itself with different arguments. How does the computer keep track of the various arguments and different function invocations if it’s the sa…
- 4Recursion has two fundamental aspects: the base case and the recursive step. When using iteration, we rely on a counting variable and a boolean condition. For example, when iterating through the …
How you'll master it
Stress-test your knowledge with quizzes that help commit syntax to memory
