Chapter 12: Recursion

This chapter discusses recursion and its use in problem-solving. A visual trace of recursive calls is provided, and recursive applications are discussed. Recursive algorithms for many tasks are presented, such as finding factorials, finding a greatest common denominator (GCD), and summing a range of values in a list, and the classic Towers of Hanoi example are presented.

Chapter 12 Recursion - Learning Objectives:

Upon completion of this week's material, you should be able to:

describe what Recursion is.
describe how Recursion in used in programming.
describe what a Direct and Indirect Recursion are.
create and use Recursion in a Python program
describe Recursion versus Looping .
describe what mutator methods are.

Please continue on to the next page