recursion thinking about it
play

Recursion: Thinking About It 7 January 2019 OSU CSE 1 Recursion - PowerPoint PPT Presentation

May 10, 2023 •19 likes •599 views

Recursion: Thinking About It 7 January 2019 OSU CSE 1 Recursion A remarkably important concept and programming technique in computer science is recursion A recursive method is simply one that calls itself There are two quite

  1. Recursion: Thinking About It 7 January 2019 OSU CSE 1

  2. Recursion • A remarkably important concept and programming technique in computer science is recursion – A recursive method is simply one that calls itself • There are two quite different views of recursion! – We ask for your patience as we introduce them one at a time... 7 January 2019 OSU CSE 2

  3. Question Considered Now • How should you think about recursion so you can use it to develop elegant recursive methods to solve certain problems? 7 January 2019 OSU CSE 3

  4. Question Considered Next • Why do those recursive methods work? 7 January 2019 OSU CSE 4

  5. Question Considered Only Later • How do those recursive methods work? – Don’t worry; we will come back to this – If you start by insisting on knowing the answer to this question, you may never be fully capable of developing elegant recursive solutions to problems! 7 January 2019 OSU CSE 5

  6. Suppose... • You need to reverse a String • Contract specification looks like this: /** * Reverses a String. * ... * @ensures * reversedString = rev (s) */ private static String reversedString(String s) {...} 7 January 2019 OSU CSE 6

  7. Suppose... Try to implement it • You need to reverse a String (i.e., write the method • Contract specification looks like this: body). /** * Reverses a String. * ... * @ensures * reversedString = rev (s) */ private static String reversedString(String s) {...} 7 January 2019 OSU CSE 7

  8. One Possible Solution private static String reversedString(String s) { String rs = ""; for ( int i = 0; i < s.length(); i++) { rs = s.charAt(i) + rs; } return rs; } 7 January 2019 OSU CSE 8

  9. Trace It s = "abc" rs = "" for ( int i = 0; i < s.length(); i++) { rs = s.charAt(i) + rs; } 7 January 2019 OSU CSE 9

  10. Trace It: Iteration 1 s = "abc" rs = "" for ( int i = 0; i < s.length(); i++) { s = "abc" rs = "" i = 0 rs = s.charAt(i) + rs; } 7 January 2019 OSU CSE 10

  11. Trace It: Iteration 1 s = "abc" rs = "" for ( int i = 0; i < s.length(); i++) { s = "abc" rs = "" i = 0 rs = s.charAt(i) + rs; s = "abc" rs = "a" i = 0 } 7 January 2019 OSU CSE 11

  12. Trace It: Iteration 2 s = "abc" rs = "" for ( int i = 0; i < s.length(); i++) { s = "abc" rs = "a" i = 1 rs = s.charAt(i) + rs; s = "abc" rs = "a" i = 0 } 7 January 2019 OSU CSE 12

  13. Trace It: Iteration 2 s = "abc" rs = "" for ( int i = 0; i < s.length(); i++) { s = "abc" rs = "a" i = 1 rs = s.charAt(i) + rs; s = "abc" rs = "ba" i = 1 } 7 January 2019 OSU CSE 13

  14. Trace It: Iteration 3 s = "abc" rs = "" for ( int i = 0; i < s.length(); i++) { s = "abc" rs = "ba" i = 2 rs = s.charAt(i) + rs; s = "abc" rs = "ba" i = 1 } 7 January 2019 OSU CSE 14

  15. Trace It: Iteration 3 s = "abc" rs = "" for ( int i = 0; i < s.length(); i++) { s = "abc" rs = "ba" i = 2 rs = s.charAt(i) + rs; s = "abc" rs = "cba" i = 2 } 7 January 2019 OSU CSE 15

  16. Trace It: Ready to Return s = "abc" rs = "" for ( int i = 0; i < s.length(); i++) { s = "abc" rs = "ba" i = 2 rs = s.charAt(i) + rs; s = "abc" rs = "cba" i = 2 } s = "abc" rs = "cba" 7 January 2019 OSU CSE 16

  17. Oh, Did I Mention... • There is already a static method in the class FreeLunch , with exactly the same contract: /** * Reverses a String. * ... * @ensures * reversedString = rev (s) */ private static String reversedString(String s) {...} 7 January 2019 OSU CSE 17

  18. A Free Lunch Sounds Good! • The slightly nasty thing about the FreeLunch class is that its methods will not directly solve your problem: you have to make your problem “smaller” first • This reversedString code will not work: private static String reversedString(String s) { return FreeLunch.reversedString(s); } 7 January 2019 OSU CSE 18

  19. Recognizing the Smaller Problem • A key to recursive thinking is the ability to recognize some smaller instance of the same problem “hiding inside” the problem you need to solve • Here, suppose we recognize the following property of string reversal: rev (<x> * a) = rev (a) * <x> 7 January 2019 OSU CSE 19

  20. The Smaller Problem • If we had some way to reverse a string of length 4, say, then we could reverse a string of length 5 by: – removing the character on the left end – reversing what’s left – adding the character that was removed onto the right end 7 January 2019 OSU CSE 20

  21. The Smaller Problem • If we had some way to reverse a string of This is a smaller instance of exactly the same problem as we need to solve. length 4, say, then we could reverse a string of length 5 by: – removing the character on the left end – reversing what’s left – adding the character that was removed onto the right end 7 January 2019 OSU CSE 21

  22. Time for Our Free Lunch • We can use the FreeLunch class now: private static String reversedString(String s) { String sub = s.substring(1); String revSub = FreeLunch.reversedString(sub); String result = revSub + s.charAt(0); return result; } 7 January 2019 OSU CSE 22

  23. Trace It s = "abc" String sub = s.substring(1); s = "abc" sub = "bc" String revSub = FreeLunch.reversedString(sub); s = "abc" sub = "bc" revSub = "cb" String result = revSub + s.charAt(0); s = "abc" sub = "bc" revSub = "cb" result = "cba" 7 January 2019 OSU CSE 23

  24. Trace It How do you trace over this call? By s = "abc" looking at the contract, as usual! String sub = s.substring(1); s = "abc" sub = "bc" String revSub = FreeLunch.reversedString(sub); s = "abc" sub = "bc" revSub = "cb" String result = revSub + s.charAt(0); s = "abc" sub = "bc" revSub = "cb" result = "cba" 7 January 2019 OSU CSE 24

  25. Almost Done With Lunch • Is this code correct? private static String reversedString(String s) { String sub = s.substring(1); String revSub = FreeLunch.reversedString(sub); String result = revSub + s.charAt(0); return result; } 7 January 2019 OSU CSE 25

  26. Almost Done With Lunch • Is this code correct? private static String reversedString(String s) { String sub = s.substring(1); String revSub = FreeLunch.reversedString(sub); String result = revSub + s.charAt(0); return result; This call has a precondition: s must not be } the empty string (which can be gleaned from the String API with a careful reading). 7 January 2019 OSU CSE 26

  27. Almost Done With Lunch • Is this code correct? This call has a precondition: s must not be the empty string (which can be gleaned from private static String reversedString(String s) { the String API with a careful reading). String sub = s.substring(1); String revSub = FreeLunch.reversedString(sub); String result = revSub + s.charAt(0); return result; } 7 January 2019 OSU CSE 27

  28. Accounting for Empty s private static String reversedString(String s) { if (s.length() == 0) { return s; } else { String sub = s.substring(1); String revSub = FreeLunch.reversedString(sub); String result = revSub + s.charAt(0); return result; } } 7 January 2019 OSU CSE 28

  29. Accounting for Empty s private static String reversedString(String s) { if (s.length() == 0) { return s; } else { String sub = s.substring(1); String revSub = This test could also be done as: FreeLunch.reversedString(sub); s.equals("") String result = revSub + s.charAt(0); but not as: return result; s == "" } } 7 January 2019 OSU CSE 29

  30. Accounting for Empty s private static String reversedString(String s) { if (s.length() == 0) { return s; } else { String sub = s.substring(1); String revSub = FreeLunch.reversedString(sub); Returning an empty string could String result = revSub + s.charAt(0); also be written as: return result; return ""; } } 7 January 2019 OSU CSE 30

  31. Oh, Did I Mention... • Sorry, there is no FreeLunch ! 7 January 2019 OSU CSE 31

  32. There Is No FreeLunch ?!? private static String reversedString(String s) { if (s.length() == 0) { return s; } else { String sub = s.substring(1); String revSub = FreeLunch.reversedString(sub); String result = revSub + s.charAt(0); return result; } } 7 January 2019 OSU CSE 32

  33. There Is No FreeLunch ?!? private static String reversedString(String s) { if (s.length() == 0) { return s; } else { String sub = s.substring(1); String revSub = reversedString(sub); String result = revSub + s.charAt(0); return result; } } 7 January 2019 OSU CSE 33

  34. We Don’t Need a FreeLunch We just wrote the code for reversedString , private static String reversedString(String s) { so we can call our own version rather than the if (s.length() == 0) { one from FreeLunch . return s; } else { String sub = s.substring(1); String revSub = reversedString(sub); String result = revSub + s.charAt(0); return result; } } 7 January 2019 OSU CSE 34

Recommend

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
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 II Fundamentals of Computer Science Outline Recursion A method calling itself

Recursion II Fundamentals of Computer Science Outline Recursion A method calling itself

Recursion II Fundamentals of Computer Science Outline Recursion A method calling itself A new way of thinking about a problem A powerful programming paradigm Examples: Last time: Factorial, binary search, H-tree,

644 views • 43 slides
Recursion II Fundamentals of Computer Science Outline Recursion A method calling itself

Recursion II Fundamentals of Computer Science Outline Recursion A method calling itself

Recursion II Fundamentals of Computer Science Outline Recursion A method calling itself A new way of thinking about a problem A powerful programming paradigm Examples: Last time: Factorial, binary search, H-tree,

839 views • 42 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
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 Ch 14 Recursion There are two important parts of recursion: -A stopping case that

Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that

Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that ends the recursion -A reduction case that reduces the problem What are the base and stopping cases for the Fibonacci numbers? (sum of the previous

296 views • 11 slides
Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that

Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that

Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that ends the recursion -A reduction case that reduces the problem What are the base and stopping cases for the Fibonacci numbers? (sum of the previous

279 views • 8 slides
Recursion Ch 14 Announcements Midterm graded on gradescope Highlights - recursion Recursion

Recursion Ch 14 Announcements Midterm graded on gradescope Highlights - recursion Recursion

Recursion Ch 14 Announcements Midterm graded on gradescope Highlights - recursion Recursion No fancy blue words or classes this chapter Recursion is simply calling a method from inside itself This copy will re-run the method on any new

363 views • 24 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 &quot;Recursion&quot;. Recursion If you still don't get it, see:

Definition Recursion See &quot;Recursion&quot;. 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
Recursion Recursion Recursion means to define something in terms of itself. In order to

Recursion Recursion Recursion means to define something in terms of itself. In order to

CS206 CS206 Recursion Recursion Recursion means to define something in terms of itself. In order to understand recursion, one must A directory is a collection of files and directories. first understand recursion. Anonymous

60 views • 4 slides
CSSE 220 Recursion Checkout Recursion project from SVN Recursion A solution technique where

CSSE 220 Recursion Checkout Recursion project from SVN Recursion A solution technique where

CSSE 220 Recursion Checkout Recursion project from SVN Recursion A solution technique where the same computation occurs repeatedly as the problem is solved recurs Examples: Sierpinski Triangle:

699 views • 7 slides
Patterns of recursion Readings: none. Topics: Simple recursion Using accumulative recursion

Patterns of recursion Readings: none. Topics: Simple recursion Using accumulative recursion

Patterns of recursion Readings: none. Topics: Simple recursion Using accumulative recursion Recognizing generative recursion 1/22 09: Patterns CS 135 Simple vs. general recursion All of the recursion we have done to date has followed a

386 views • 22 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
Tail Recursion and Accumulators Recursion Should now be

Tail Recursion and Accumulators Recursion Should now be

Tail Recursion and Accumulators Recursion Should now be comfortable with recursion: No harder than using a loop (Maybe?) OAen much easier than

346 views • 24 slides
Recursion Ch 14 Highlights - recursion Recursion No fancy blue words or classes this chapter

Recursion Ch 14 Highlights - recursion Recursion No fancy blue words or classes this chapter

Recursion Ch 14 Highlights - recursion Recursion No fancy blue words or classes this chapter Recursion is simply calling a method from inside itself This copy will re-run the method on any new arguments or information (See:

158 views • 14 slides
Objectives become familiar with the idea of recursion learn to use recursion as a

Objectives become familiar with the idea of recursion learn to use recursion as a

Objectives become familiar with the idea of recursion learn to use recursion as a programming tool Recursion become familiar with the binary search algorithm as an example of recursion Chapter 11 become familiar with the merge

616 views • 18 slides
Recursion, tail recursion Recursion is the lifeblood of repetition in lisp Even loop

Recursion, tail recursion Recursion is the lifeblood of repetition in lisp Even loop

Recursion, tail recursion Recursion is the lifeblood of repetition in lisp Even loop functions are implemented recursively Typical function setup: Error-check parameters Check for base cases Handle general/recursive cases

429 views • 11 slides
CS200: Recursion and induction Prichard Ch. 6.1 &amp; 6.3 CS200 - Recursion 1 CS200 -

CS200: Recursion and induction Prichard Ch. 6.1 &amp; 6.3 CS200 - Recursion 1 CS200 -

CS200: Recursion and induction Prichard Ch. 6.1 &amp; 6.3 CS200 - Recursion 1 CS200 - Recursion 2 Backtracking n Problem solving technique that involves moves: guesses at a solution. n Depth First Search: in case of failure retrace

272 views • 23 slides
Sierpiski , Recursion and Efficiency, Mutual Recursion Checkout Recursion2 and

Sierpiski , Recursion and Efficiency, Mutual Recursion Checkout Recursion2 and

Sierpiski , Recursion and Efficiency, Mutual Recursion Checkout Recursion2 and SortingAndSearching projects from SVN Any method that calls itself On a simpler problem So that it makes progress toward completion Indirect recursion:

401 views • 25 slides
Recursion Contents Recursion in general Simple examples The need to move closer to a

Recursion Contents Recursion in general Simple examples The need to move closer to a

Lecture 4 Recursion Contents Recursion in general Simple examples The need to move closer to a solution List processing predicates Recursion in general Recursion is the idea of defining something in terms of itself. It

474 views • 15 slides
Discussion 03 Recursion Tree recursion Recursion Facts 1. Base case : What is the simplest

Discussion 03 Recursion Tree recursion Recursion Facts 1. Base case : What is the simplest

Discussion 03 Recursion Tree recursion Recursion Facts 1. Base case : What is the simplest problem that you can solve? In other words, is there an input to the problem for which you automatically know what to return? 2. Make a recursive call !

460 views • 21 slides
Building Java Programs Chapter 12 introduction to recursion reading: 12.1 Recursion

Building Java Programs Chapter 12 introduction to recursion reading: 12.1 Recursion

Building Java Programs Chapter 12 introduction to recursion reading: 12.1 Recursion recursion : The definition of an operation in terms of itself. Solving a problem using recursion depends on solving smaller occurrences of the same

426 views • 10 slides

More recommend