Savitch ch 14

Overview ,[object Object],[object Object],[object Object],Slide 14-

14.1 Recursive Functions for Tasks

Recursive Functions for Tasks ,[object Object],[object Object],[object Object],[object Object],[object Object],Slide 14-

Case Study: Vertical Numbers ,[object Object],[object Object],Slide 14-

Case Study: Vertical Numbers ,[object Object],[object Object],[object Object],[object Object],[object Object],Slide 14-

Case Study: Vertical Numbers (cont.) ,[object Object],[object Object],Slide 14-

Case Study: Vertical Numbers (cont.) ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 14- Display 14.1 ( 1 ) Display 14.1 ( 2 )

Tracing a Recursive Call ,[object Object],Slide 14- Calls write_vertical(12) resume Output 3 Function call ends

Tracing write_vertical(12) ,[object Object],Slide 14- Calls write_vertical(1) resume Output 2 Function call ends

Tracing write_vertical(1) ,[object Object],Slide 14- Simplest case is now true Function call ends Output 1

A Closer Look at Recursion ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 14-

How Recursion Ends ,[object Object],[object Object],[object Object],[object Object],[object Object],Slide 14-

"Infinite" Recursion ,[object Object],[object Object],Slide 14-

Example: Infinite Recursion ,[object Object],Slide 14-

Stacks for Recursion ,[object Object],[object Object],[object Object],[object Object],[object Object],Slide 14-

Last-in / First-out ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 14-

Stacks and The Recursive Call ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 14-

The Stack and Ending Recursive Calls ,[object Object],[object Object],[object Object],[object Object],Slide 14-

Activation Frames ,[object Object],[object Object],[object Object],[object Object],Slide 14-

Stack Overflow ,[object Object],[object Object],[object Object],[object Object],Slide 14-

Recursion versus Iteration ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 14- Display 14.2

Section 14.1 Conclusion ,[object Object],[object Object],[object Object],[object Object],Slide 14-

14.2 Recursive Functions for Values

Recursive Functions for Values ,[object Object],[object Object],[object Object],[object Object],Slide 14-

Program Example: A Powers Function ,[object Object],[object Object],[object Object],[object Object],Slide 14- Display 14.3

Tracing power(2,1) ,[object Object],Slide 14- Call to power(2,0) resume 1 return 2 Function Ends

Tracing power(2,0) ,[object Object],Slide 14- Function call ends 1 is returned

Tracing power(2, 3) ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 14- Display 14.4

Section 14.2 Conclusion ,[object Object],[object Object],Slide 14-

Thinking Recursively ,[object Object],[object Object],[object Object],[object Object],[object Object],Slide 14-

Reviewing the power function ,[object Object],[object Object],Slide 14-

Review of power (cont.) ,[object Object],[object Object],Slide 14-

Recursive void-functions ,[object Object],[object Object],[object Object],[object Object],Slide 14-

Case Study: Binary Search ,[object Object],[object Object],[object Object],[object Object],Slide 14-

Binary Search: Problem Definition ,[object Object],[object Object],[object Object],[object Object],Slide 14-

Binary Search Problem Definition (cont.) ,[object Object],Slide 14-

Binary Search Algorithm Design ,[object Object],[object Object],[object Object],[object Object],[object Object],Slide 14-

Binary Search Algorithm Design (cont.) ,[object Object],[object Object],Slide 14-

Binary Search Algorithm Design (cont.) ,[object Object],[object Object],[object Object],[object Object],Slide 14-

Binary Search Algorithm Design (cont.) ,[object Object],Slide 14-

Binary Search Algorithm Design (cont.) ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Slide 14- Display 14.5 Display 14.7

Binary Search Writing the Code ,[object Object],[object Object],Slide 14- Display 14.6 (1) Display 14.6 (2)

Binary Search Checking the Recursion ,[object Object],[object Object],Slide 14-

Binary Search Checking the Recursion (cont.) ,[object Object],[object Object],[object Object],[object Object],Slide 14-

Binary Search Checking the Recursion (cont.) ,[object Object],[object Object],[object Object],Slide 14-

Binary Search Efficiency ,[object Object],[object Object],[object Object],[object Object],Slide 14-

Binary Search An Iterative Version ,[object Object],[object Object],[object Object],Slide 14- Display 14.8

Program Example: A Recursive Member Function ,[object Object],[object Object],[object Object],Slide 14-

Class BankAccount Function update ,[object Object],[object Object],[object Object],[object Object],Slide 14- Display 14.9 (1) Display 14.9 (2)

Function update Checking the Recursion ,[object Object],[object Object],[object Object],[object Object],Slide 14-

Function update Checking the Recursion (cont.) ,[object Object],[object Object],Slide 14-

Savitch ch 14

Recommended

Recommended

More Related Content

What's hot

What's hot (20)

Viewers also liked

Viewers also liked (20)

Similar to Savitch ch 14

Similar to Savitch ch 14 (20)

More from Terry Yoast

More from Terry Yoast (20)

Recently uploaded

Recently uploaded (20)

Savitch ch 14