Review of Recursion a recursive method calls itself

  • Slides: 12
Download presentation
Review of Recursion a recursive method calls itself to prevent infinite recursion you need

Review of Recursion a recursive method calls itself to prevent infinite recursion you need to ensure that: 1. 2. the method reaches a base case each recursive call makes progress towards a base case (i. e. reduces the size of the problem) to solve a problem with a recursive algorithm: 1. 2. 1 identify the base cases (the cases corresponding to the smallest version of the problem you are trying to solve) figure out the recursive call(s)

A palindrome is a sequence of symbols that is the same forwards and backwards:

A palindrome is a sequence of symbols that is the same forwards and backwards: 1. "level" "yo banana boy" Write a recursive algorithm that returns true if a string is a palindrome (and false if not); assume that the string has no spaces or punctuation marks. 2

sketch a small example of the problem 3 it will help you find the

sketch a small example of the problem 3 it will help you find the base cases it might help you find the recursive cases

4

4

[AJ, p 667, Q 4] 2. 0 5 80 6 57 10 start at

[AJ, p 667, Q 4] 2. 0 5 80 6 57 10 start at the first square on left on each move you can move 1 or 2 squares to the right each square you land on has a cost (the value in the square) 3 costs are always positive goal is to reach the rightmost square with the lowest cost

6

6

[AJ, p 668, Q 7] 3. A C move the stack of n disks

[AJ, p 668, Q 7] 3. A C move the stack of n disks from A to C 7 B can move one disk at a time from the top of one stack onto another stack cannot move a larger disk onto a smaller disk

8

8

base case n = 1 1. move disk from A to C recursive case

base case n = 1 1. move disk from A to C recursive case 1. 2. 3. 9 move (n – 1) disks from A to B move 1 disk from A to C move (n – 1) disks from B to C

10

10

Correctness and Termination proving correctness requires that you do two things: 1. 2. prove

Correctness and Termination proving correctness requires that you do two things: 1. 2. prove that each base case is correct assume that the recursive invocation is correct and then prove that each recursive case is correct proving termination requires that you do two things: 1. 2. 11 define the size of each method invocation prove that each recursive invocation is smaller than the original invocation

4. 5. 6. 12 Prove that the recursive palindrome algorithm is correct and terminates.

4. 5. 6. 12 Prove that the recursive palindrome algorithm is correct and terminates. Prove that the recursive Jump It algorithm is correct and terminates. Prove the recursive Towers of Hanoi algorithm is correct and terminates.

Recursion Recursive method Calls itself directly or indirectlyRecursion Recursive method Calls itself directly or indirectly
1 Recursion Recursive method Calls itself directly or1 Recursion Recursive method Calls itself directly or
Recursion Review A recursive function calls itself butRecursion Review A recursive function calls itself but
Recursion Recursive Thinking Recursive Programming Recursion versus IterationRecursion Recursive Thinking Recursive Programming Recursion versus Iteration
Recursion Recursive Thinking Recursive Programming Recursion versus IterationRecursion Recursive Thinking Recursive Programming Recursion versus Iteration
Recursion Definition A method that calls itself ExamplesRecursion Definition A method that calls itself Examples
Recursion Method calls itself iteratively until a baseRecursion Method calls itself iteratively until a base
Recursion Recursion Slide 2 Recursion Recursion Slide 3Recursion Recursion Slide 2 Recursion Recursion Slide 3
Recursion Examples Recursion review Recursion review Scenario YouRecursion Examples Recursion review Recursion review Scenario You
Recursion Review of recursive functions Recursive definitions ContrastRecursion Review of recursive functions Recursive definitions Contrast
Review Introduction to Recursion Recursive Definition Recursive AlgorithmsReview Introduction to Recursion Recursive Definition Recursive Algorithms