Lesson 824 of 1524
Recursion
Demonstrate how recursion uses simpler solutions to build a bigger solution
Practice this chapterDemonstrate how recursion uses simpler solutions to build a bigger solution Demonstrate how to compute a recursive solution for the factorial function
Demonstrate the use of recursion to solve a string problem
Be able to describe the concept of recursion; identify a recursive case and a base case in a recursive algorithm; use the built-in count() list function.
Worked example
What does this chapter state?
- 1Demonstrate how recursion uses simpler solutions to build a bigger solution
- 2That claim is the chapter’s own statement.
- 3Answer from the claim, not from where the chapter sits in the book.
Result: Demonstrate how recursion uses simpler solutions to build a bigger solution
Why. The sentence is taken from this chapter’s summary or key concepts.
Answer with the meaning this chapter gives. A nearby idea from the same book is a different term.
Practice margin
This chapter
A fresh set from this chapter only. Choose 10 or 20. Multiple choice and fill-in, with no repeat inside the set.