class 09 recursion practice how recursive programs work
play

Class 09: Recursion practice, how recursive programs work Recall the - PowerPoint PPT Presentation

Feb 14, 2023 •186 likes •751 views

Class 09: Recursion practice, how recursive programs work Recall the list-length procedure (define (list-length alon) (cond [(empty? alon) 0] [(cons? alon) (+ 1 (list-length (rest alon)))])) Why does it correctly compute the length of any

  1. Class 09: Recursion practice, how recursive programs work

  2. Recall the list-length procedure (define (list-length alon) (cond [(empty? alon) 0] [(cons? alon) (+ 1 (list-length (rest alon)))])) • Why does it correctly compute the length of any list? • Does it work for lists of length zero? • How many of those are there? • Does it work for lists of length 1? • Yes… • Provided that the recursive call computing the length of the rest of the list works • The rest of the list has length 0, so its length does get computed correctly • Same argument for length 2, 3, 4, …

  3. Recursion diagrams and correct procedures • Recursion diagrams prepare for this logical analysis to work! • They ensure that the answer for length-zero lists is correct • They ensure that if the answer for length- (k-1) lists is correct, then the answer for length- k lists will be as well!

  4. Does it work at a mechanical level? • Do the rules of evaluation lead to the results you expect? • Yes (no surprise!) • We’ll see this by computing the length of a length-one list, using the rules.

  5. Warmup: cleaning up Boolean expressions

  6. A recursion problem • contains17? takes as input an int list , and returns true if one of the items is the number 17, and false if the list does not contain a 17. • The type-signature is contains17?: (int list) - > bool • With your neighbor, draw recursion diagrams for three cases: • (cons 13 (cons 4 empty)) • (cons 17 empty) • (cons 1 (cons 17 empty))

  7. OI: (cons 13 (cons 4 empty)) RI: (cons 4 empty) RO: false OO: false

  8. OI: (cons 17 empty) RI: empty RO: false OO: true

  9. OI: (cons 1 (cons 17 empty)) RI: (cons 17 empty) RO: true OO: true

  10. OI: (cons 1 (cons 17 empty)) RI: (cons 17 empty) RO: true If RO is true, OO is true If RO is false, but (first OO) is 17, then OO is true Otherwise OO is false OO: true

  11. Code (define (contains17? aloi) (cond [(empty? aloi) false] [(cons? aloi) (if (contains17? (rest aloi)) true (if (= 17 (first aloi)) true false))]))

  12. Code (define (contains17? aloi) (cond [(empty? aloi) false] [(cons? aloi) ( or (contains17? (rest aloi)) (if (= 17 (first aloi)) true false))]))

  13. Code (define (contains17? aloi) (cond [(empty? aloi) false] [(cons? aloi) ( or (contains17? (rest aloi)) (if (= 17 (first aloi)) true false))]))

  14. Code (better) (define (contains17? aloi) (cond [(empty? aloi) false] [(cons? aloi) ( or (contains17? (rest aloi)) (= 17 (first aloi))]))

  15. Code (even better) (define (contains17? aloi) (cond [(empty? aloi) false] [(cons? aloi) ( or (= 17 (first aloi)) (contains17? (rest aloi))]))

  16. Evaluation practice (already done previously, but left here for reference!)

  17. Color coding • Values are in green • Environment is a sequence of purple boxes; TLE shorthand shows just + and – as builtin procs.

  18. (skip to slide 42)

  19. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: B: C: Value:

  20. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: builtin+ B: C: Value:

  21. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: builtin+ B: C: Value: -------------------------------- B: (- 3 4) D E F D: E: F: value:

  22. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: builtin+ B: C: Value: -------------------------------- B: (- 3 4) D E F D: builtin- E: F: value:

  23. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: builtin+ B: C: Value: -------------------------------- B: (- 3 4) D E F D: builtin- E: 3 F: 4 value:

  24. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: builtin+ B: C: Value: -------------------------------- B: (- 3 4) D E F D: builtin- E: 3 F: 4 value: -1

  25. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: builtin+ B: -1 C: Value: -------------------------------- B: (- 3 4) D E F D: builtin- E: 3 F: 4 value: -1

  26. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: builtin+ B: -1 C: Value: -------------------------------- B: (- 3 4) | C: (+ 2 5) D E F | G H J D: builtin- | G: E: 3 | H: F: 4 | J: value: -1 | value:

  27. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: builtin+ B: -1 C: Value: -------------------------------- B: (- 3 4) | C: (+ 2 5) D E F | G H J D: builtin- | G: builtin+ E: 3 | H: F: 4 | J: value: -1 | value:

  28. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: builtin+ B: -1 C: Value: -------------------------------- B: (- 3 4) | C: (+ 2 5) D E F | G H J D: builtin- | G: builtin+ E: 3 | H: 2 F: 4 | J: value: -1 | value:

  29. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: builtin+ B: -1 C: Value: -------------------------------- B: (- 3 4) | C: (+ 2 5) D E F | G H J D: builtin- | G: builtin+ E: 3 | H: 2 F: 4 | J: 5 value: -1 | value:

  30. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: builtin+ B: -1 C: Value: -------------------------------- B: (- 3 4) | C: (+ 2 5) D E F | G H J D: builtin- | G: builtin+ E: 3 | H: 2 F: 4 | J: 5 value: -1 | value: 7

  31. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: builtin+ B: -1 C: 7 Value: -------------------------------- B: (- 3 4) | C: (+ 2 5) D E F | G H J D: builtin- | G: builtin+ E: 3 | H: 2 F: 4 | J: 5 value: -1 | value: 7

  32. (+ (- 3 4) (+ 2 5)) + builtin+ A B C builtin- - A: builtin+ B: -1 C: 7 Value: 6 -------------------------------- B: (- 3 4) | C: (+ 2 5) D E F | G H J D: builtin- | G: builtin+ E: 3 | H: 2 F: 4 | J: 5 value: -1 | value: 7

  33. (define (f x) (+ x 1)) + builtin+ (+ (f 1) (f 3)) builtin- - f closure{(x, (+ A B C x 1)) A: builtin+ B: C: Value: -------------------------------- B: (f 1) | C: (f 3) D E | G H D: closure (x, (+ x 1))| G: E: 1 | H: | | |

  34. (define (f x) (+ x 1)) + builtin+ (+ (f 1) (f 3)) builtin- - A B C A: builtin+ B: C: x 1 Value: -------------------------------- B: (f 1) | C: (f 3) D E | G H D: closure (x, (+ x 1))| G: E: 1 | H: Bind x -> 1; evaluate | (+ x 1) | | | |

  35. (define (f x) (+ x 1)) + builtin+ (+ (f 1) (f 3)) builtin- - A B C A: builtin+ B: C: x 1 Value: -------------------------------- B: (f 1) | J: (+ x 1) D E | K L M D: closure (x, (+ x 1))| K: builtin+ E: 1 | L: 1 Bind x -> 1; evaluate | M: 1 J: (+ x 1) | Value: 2 Value: | |

  36. (define (f x) (+ x 1)) + builtin+ (+ (f 1) (f 3)) builtin- - A B C A: builtin+ B: C: x 1 Value: -------------------------------- B: (f 1) | J: (+ x 1) D E | K L M D: closure (x, (+ x 1))| K: builtin+ E: 1 | L: 1 Bind x -> 1; evaluate | M: 1 J: (+ x 1) | Value: 2 Value: 2 | |

  37. (define (f x) (+ x 1)) + builtin+ (+ (f 1) (f 3)) builtin- - A B C A: builtin+ B: C: Value: -------------------------------- B: (f 1) | C: (f 3) D E | G H D: closure (x, (+ x 1))| G: E: 1 | H: Bind x -> 1; evaluate | (+ x 1) | value: 2 | Drop the new binding |

  38. (define (f x) (+ x 1)) + builtin+ (+ (f 1) (f 3)) builtin- - A B C A: builtin+ B: 2 C: Value: -------------------------------- B: (f 1) | C: (f 3) D E | G H D: closure (x, (+ x 1))| G: closure (x, (+ x 1)) E: 1 | H: 3 Bind x -> 1; evaluate | (+ x 1) | value: 2 | Drop the new binding |

  39. (define (f x) (+ x 1)) + builtin+ (+ (f 1) (f 3)) builtin- - A B C A: builtin+ B: 2 C: x 3 Value: -------------------------------- B: (f 1) | C: (f 3) D E | G H D: closure (x, (+ x 1))| G: closure (x, (+ x 1)) E: 1 | H: 3 Bind x -> 1; evaluate | Bind x -> 3; evaluate (+ x 1) | (+ x 1) value: 2 | value: 4 Drop the new binding | Drop the new binding

  40. (define (f x) (+ x 1)) + builtin+ (+ (f 1) (f 3)) builtin- - A B C A: builtin+ B: 2 C: 4 Value: -------------------------------- B: (f 1) | C: (f 3) D E | G H D: closure (x, (+ x 1))| G: closure (x, (+ x 1)) E: 1 | H: 3 Bind x -> 1; evaluate | Bind x -> 3; evaluate (+ x 1) | (+ x 1) value: 2 | value: 4 Drop the new binding | Drop the new binding

Recommend

Recursion and Induction: Reasoning About Recursive Programs Greg Plaxton Theory in Programming

Recursion and Induction: Reasoning About Recursive Programs Greg Plaxton Theory in Programming

Recursion and Induction: Reasoning About Recursive Programs Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Proving Properties of power2 Recall the recursive program

277 views • 6 slides
1 Recursive Definitions Infinite Recursion The recursive part of the LIST definition is used

1 Recursive Definitions Infinite Recursion The recursive part of the LIST definition is used

CSC 2014 Java Bootcamp Lecture 9 Recursion 2 Recursion Recursion is a fundamental programming technique that can provide an elegant solution certain kinds of problems RECURSIVE THINKING 3 4 Recursive Thinking Recursive Definitions

148 views • 4 slides
One-Slide Summary List Writing recursive functions that operate on Recursion: recursive data

One-Slide Summary List Writing recursive functions that operate on Recursion: recursive data

One-Slide Summary List Writing recursive functions that operate on Recursion: recursive data structures takes practice . There are standard approaches to such problems. list? , member , sumlist , intsto , map and filter Practice are all

757 views • 6 slides
Building Java Programs Chapter 12 recursive programming reading: 12.2 - 12.4 Recursion and

Building Java Programs Chapter 12 recursive programming reading: 12.2 - 12.4 Recursion and

Building Java Programs Chapter 12 recursive programming reading: 12.2 - 12.4 Recursion and cases Every recursive algorithm involves at least 2 cases: base case : simple problem that can be solved directly. recursive case : more

266 views • 9 slides
Recursion READING: LC textbook chapter 7 Recursion Recursive algorithms A

Recursion READING: LC textbook chapter 7 Recursion Recursive algorithms A

Summary Topics recursion overview simple examples Sierpinski gasket counting blobs in a grid csci 210: Data Structures Hanoi towers Recursion READING: LC textbook chapter 7 Recursion Recursive

308 views • 7 slides
Chapter 17 Recursion Chapter Scope The concept of recursion Recursive methods

Chapter 17 Recursion Chapter Scope The concept of recursion Recursive methods

Chapter 17 Recursion Chapter Scope The concept of recursion Recursive methods Infinite recursion When to use (and not use) recursion Using recursion to solve problems Solving a maze Towers of Hanoi Java Foundations,

602 views • 41 slides
Definition Recursion See "Recursion". Recursion If you still don't get it, see:

Definition Recursion See "Recursion". Recursion If you still don't get it, see:

Advanced Programming Recursion Recursion Summary n Definition of recursion and divide et impera n Simple recursive algorithms n Merge Sort n Quicksort n More complex recursive algorithms 2 1 Advanced Programming Recursion

893 views • 60 slides
Recursive Methods Noter ch.2 Recursive Methods Recursive problem solution Problems

Recursive Methods Noter ch.2 Recursive Methods Recursive problem solution Problems

Recursive Methods Noter ch.2 Recursive Methods Recursive problem solution Problems that are naturally solved by recursion Examples: Recursive function: Fibonacci numbers Recursive graphics: Fractals Mutual recursion:

796 views • 61 slides
Recursion Calling a Function from Within Itself Recursion: What is it? Recursive functions are

Recursion Calling a Function from Within Itself Recursion: What is it? Recursive functions are

Recursion Calling a Function from Within Itself Recursion: What is it? Recursive functions are functions which rely on themselves to calculate part of the answer. Recursive functions usually have a base case that causes the recursion to end.

382 views • 10 slides
Reading quiz List Recursion: Practice & Examples #1 #2 One-Slide Summary Outline

Reading quiz List Recursion: Practice & Examples #1 #2 One-Slide Summary Outline

Reading quiz List Recursion: Practice & Examples #1 #2 One-Slide Summary Outline Writing recursive functions that operate on Review: Procedure Problem Solving recursive data structures takes practice . Review: [a,b,c],

226 views • 7 slides
Reading quiz List Recursion: Practice & Examples #1 #2 One-Slide Summary Outline

Reading quiz List Recursion: Practice & Examples #1 #2 One-Slide Summary Outline

Reading quiz List Recursion: Practice & Examples #1 #2 One-Slide Summary Outline Writing recursive functions that operate on Review: Procedure Problem Solving recursive data structures takes practice . There Review: list,

417 views • 6 slides
RECURSION Chapter 5 Recursive Thinking Section 5.1 1 11/2/2017 Recursive Thinking

RECURSION Chapter 5 Recursive Thinking Section 5.1 1 11/2/2017 Recursive Thinking

11/2/2017 RECURSION Chapter 5 Recursive Thinking Section 5.1 1 11/2/2017 Recursive Thinking Recursion is a problem-solving approach that can be used to generate simple solutions to certain kinds of problems that are difficult to solve

530 views • 30 slides
Recursion Announcements Recursive Functions Recursive Functions 4 Recursive Functions

Recursion Announcements Recursive Functions Recursive Functions 4 Recursive Functions

Recursion Announcements Recursive Functions Recursive Functions 4 Recursive Functions Definition : A function is called recursive if the body of that function calls itself, either directly or indirectly 4 Recursive Functions Definition

1.11k views • 89 slides
Review Recursion Factorial (Iterative and Recursive versions) Call Stack (Last-in,

Review Recursion Factorial (Iterative and Recursive versions) Call Stack (Last-in,

Review Recursion Factorial (Iterative and Recursive versions) Call Stack (Last-in, first-out Queue) Tracing recursive functions Fibonacci Sequence Recursive Implementation Recursive Maze Generation One can declare an

921 views • 16 slides
Advanced #2: Recursion SAMS SENIOR CS TRACK Learning Goals Understand what recursion means

Advanced #2: Recursion SAMS SENIOR CS TRACK Learning Goals Understand what recursion means

Advanced #2: Recursion SAMS SENIOR CS TRACK Learning Goals Understand what recursion means Identify base and recursive cases in code Write code using recursive calls What is Recursion? The core idea of recursion is that you can manipulate the

509 views • 16 slides
Recursion in C++ Stephen P. Carl - CS 242 1 Recursion Defined Recursion is a technique for

Recursion in C++ Stephen P. Carl - CS 242 1 Recursion Defined Recursion is a technique for

Recursion in C++ Stephen P. Carl - CS 242 1 Recursion Defined Recursion is a technique for defining data structures or algorithms in terms of themselves . A recursive algorithm is a form of decomposition where rather than choosing an arbitrary

846 views • 22 slides
Recursion Announcements Recursive Functions Recursive Functions Definition : A function is

Recursion Announcements Recursive Functions Recursive Functions Definition : A function is

Recursion Announcements Recursive Functions Recursive Functions Definition : A function is called recursive if the body of that function calls itself, either directly or indirectly Implication : Executing the body of a recursive function may

320 views • 18 slides
Announcements Recursion Recursive Functions Definition : A function is called recursive if the

Announcements Recursion Recursive Functions Definition : A function is called recursive if the

Announcements Recursion Recursive Functions Definition : A function is called recursive if the body of that function calls itself, either directly or indirectly Implication : Executing the body of a recursive function may require applying that

398 views • 3 slides
One-Slide Summary List Recursion Examples & Recursive Procedures Recursive functions

One-Slide Summary List Recursion Examples & Recursive Procedures Recursive functions

One-Slide Summary List Recursion Examples & Recursive Procedures Recursive functions that operate on lists have a similar structure. list-cruncher is a higher-order function that can be used to implement many others. Decisions in a

331 views • 9 slides
Recursion 15-110 - Friday 2/21 Learning Objectives Define and recognize base cases and

Recursion 15-110 - Friday 2/21 Learning Objectives Define and recognize base cases and

Recursion 15-110 - Friday 2/21 Learning Objectives Define and recognize base cases and recursive cases in recursive code Read and write basic recursive code Trace over recursive functions that use multiple recursive calls with

940 views • 48 slides
Topics Simple Recursion Chapter 13 Recursion with a Return Value Binary Search

Topics Simple Recursion Chapter 13 Recursion with a Return Value Binary Search

Topics Simple Recursion Chapter 13 Recursion with a Return Value Binary Search Revisited Recursion Recursion Versus Iteration Simple Recursion Recursive Methods When solving a problem using recursion, the idea is to

626 views • 13 slides
Recursion and Induction: Lexical Issues; Recursive Programming Greg Plaxton Theory in

Recursion and Induction: Lexical Issues; Recursive Programming Greg Plaxton Theory in

Recursion and Induction: Lexical Issues; Recursive Programming Greg Plaxton Theory in Programming Practice, Spring 2004 Department of Computer Science University of Texas at Austin Lexical Issues Program layout Function parameters and

622 views • 21 slides
More Recursion, Linked List Recursion, and Generating All Combinations Mark Redekopp 2 Tracing

More Recursion, Linked List Recursion, and Generating All Combinations Mark Redekopp 2 Tracing

1 CSCI 103 More Recursion, Linked List Recursion, and Generating All Combinations Mark Redekopp 2 Tracing Recursive Algorithms 3 Tracing Recommendations Show the call tree Draw each instance of a recursive function as a box and

1.32k views • 62 slides
Summary of topics COMP2111 Week 3 Recursion Term 1, 2020 Recursive Data Types Recursion and

Summary of topics COMP2111 Week 3 Recursion Term 1, 2020 Recursive Data Types Recursion and

Summary of topics COMP2111 Week 3 Recursion Term 1, 2020 Recursive Data Types Recursion and induction Induction Structural Induction 1 2 Summary of topics Recursion Fundamental concept in Computer Science Recursion in algorithms:

789 views • 21 slides

More recommend