12.6 Chapter summary

Highlights from this chapter include:

• Describe the concept of recursion.
• Demonstrate how recursion uses simpler solutions to build a bigger solution.
• Identify a recursive case and a base case in a recursive algorithm.
• Demonstrate how to compute a recursive solution for the factorial function.
• Demonstrate the use of recursion to solve a string problem.
• Demonstrate the use of recursion to solve a list problem.
• Use the built-in count() list function.
• Define a recursive function to generate Fibonacci numbers.
• Use recursion to efficiently search a list.
• Demonstrate a solution to the Three Towers problem.

At this point, you should be able to solve problems using recursion.