recursion ii
play

Recursion II Fundamentals of Computer Science Outline Recursion A - PowerPoint PPT Presentation

Oct 18, 2022 •407 likes •839 views

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,

  1. Recursion II Fundamentals of Computer Science

  2. 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, Fibonacci  Today:  Brownian Motion  Sorting

  3. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push # Return here mystery(n - 2); #Push # Return here #Pop main if __name__ == "__main__": mystery(3) #Push # Return here #Pop

  4. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push # Return here mystery(n - 2); #Push # Return here 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here #Pop

  5. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push # Return here 2 mystery(n - 2); #Push # Return here mystery(3-1) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop

  6. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push 1 # Return here mystery(2-1) 2 mystery(n - 2); #Push # Return here mystery(3-1) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2

  7. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop 0 mystery(n - 1); #Push mystery(1-1) 1 # Return here mystery(2-1) 2 mystery(n - 2); #Push # Return here mystery(3-1) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1

  8. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop 0 mystery(n - 1); #Push mystery(1-1) 1 # Return here mystery(2-1) 2 mystery(n - 2); #Push # Return here mystery(3-1) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0

  9. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push 1 # Return here mystery(2-1) 2 mystery(n - 2); #Push # Return here mystery(3-1) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0

  10. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop -1 mystery(n - 1); #Push mystery(1-2) 1 # Return here mystery(2-1) 2 mystery(n - 2); #Push # Return here mystery(3-1) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0

  11. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push 1 # Return here mystery(2-1) 2 mystery(n - 2); #Push # Return here mystery(3-1) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0 -1

  12. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push # Return here 2 mystery(n - 2); #Push # Return here mystery(3-1) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0 -1

  13. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push 0 # Return here mystery(2-2) 2 mystery(n - 2); #Push # Return here mystery(3-1) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0 -1

  14. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push # Return here 2 mystery(n - 2); #Push # Return here mystery(3-1) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0 -1 0

  15. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push # Return here mystery(n - 2); #Push # Return here 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0 -1 0

  16. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push # Return here 1 mystery(n - 2); #Push # Return here mystery(3-2) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0 -1 0

  17. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push 0 # Return here mystery(1-1) 1 mystery(n - 2); #Push # Return here mystery(3-2) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0 -1 0 1

  18. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push # Return here 1 mystery(n - 2); #Push # Return here mystery(3-2) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0 -1 0 1 0

  19. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push -1 # Return here mystery(1-2) 1 mystery(n - 2); #Push # Return here mystery(3-2) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0 -1 0 1 0

  20. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push # Return here 1 mystery(n - 2); #Push # Return here mystery(3-2) 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0 -1 0 1 0

  21. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push # Return here mystery(n - 2); #Push # Return here 3 #Pop mystery(3) main if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0 -1 0 1 0

  22. Recursion Walkthrough def mystery(n): Call Stack n print(n) if n <= 0: return #Pop mystery(n - 1); #Push # Return here mystery(n - 2); #Push # Return here #Pop if __name__ == "__main__": mystery(3) #Push # Return here 3 #Pop 2 1 0 -1 0 1 0

  23. 23 Brownian Motion  Models many natural and artificial phenomenon  Motion of pollen grains in water  Price of stocks  Rugged shapes of mountains and clouds

  24. 24 Simulating Brownian Motion  Midpoint displacement method:  Track interval (x 0 , y 0 ) to (x 1 , y 1 )  Choose d displacement randomly from Gaussian  Divide in half, x m = (x 0 +x 1 )/2 and y m = (y 0 +y 1 )/2 + d  Recur on the left and right intervals

  25. 25 Recursive Midpoint Displacement Algorithm def curve(x0, y0, x1, y1, var): #Base case: stop if interval is sufficiently small if x1 - x0 < .005: base case StdDraw.line(x0, y0, x1, y1) StdDraw.show(10) return xm = (x0 + x1) / 2.0 ym = (y0 + y1) / 2.0 # Randomly displace the y coordinate of the midpoint ym = ym + random.gauss(0, math.sqrt(var)) curve(x0, y0, xm, ym, var / 2.0) reduction step curve(xm, ym, x1, y1, var / 2.0)

  26. 26 Plasma Cloud  Same idea, but in 2D  Each corner of square has some color value  Divide into four sub-squares  New corners: avg of original corners, or all 4 + random  Recur on four sub-squares

  27. 27

  28. Brownian Landscape 28

  29. 29 Divide and Conquer  Divide and conquer paradigm  Break big problem into small sub-problems  Solve sub-problems recursively  Combine results “ Divide et impera. Vendi, vidi, vici. ” -Julius Caesar  Used to solve many important problems  Sorting things, mergesort: O(N log N)  Parsing programming languages  Discrete FFT, signal processing  Multiplying large numbers  Traversing multiply linked structures (stay tuned)

  30. 30 Divide and Conquer: Sorting  Goal: Sort by number, ignore suit, aces high Approach 1) Split in half (or as close as possible) 2) Give each half to somebody to sort 3) Take two halves and merge together Unsorted pile #1 Unsorted pile #2

  31. 31 Approach 1) Split in half (or as close as possible) 2) Give each half to somebody to sort 3) Take two halves and merge together Sorted pile #1 Sorted pile #2 Merging Take card from whichever pile has lowest card

  32. 32 Approach 1) Split in half (or as close as possible) 2) Give each half to somebody to sort 3) Take two halves and merge together Sorted pile #1 Sorted pile #2

  33. 33 Approach 1) Split in half (or as close as possible) 2) Give each half to somebody to sort 3) Take two halves and merge together Sorted pile #1 Sorted pile #2

  34. 34 Approach 1) Split in half (or as close as possible) 2) Give each half to somebody to sort 3) Take two halves and merge together Sorted pile #1 Sorted pile #2

  35. 35 Approach 1) Split in half (or as close as possible) 2) Give each half to somebody to sort 3) Take two halves and merge together Sorted pile #1 Sorted pile #2

Recommend

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

279 views • 8 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 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
Recursion: Thinking About It 7 January 2019 OSU CSE 1 Recursion A remarkably important

Recursion: Thinking About It 7 January 2019 OSU CSE 1 Recursion A remarkably important

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

599 views • 58 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
Recursion Summary Topics recursion overview simple examples Sierpinski

Recursion Summary Topics recursion overview simple examples Sierpinski

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

635 views • 25 slides
WITH C++ Prof. Amr Goneid AUC Part 12. Recursion Prof. amr Goneid, AUC 1 Recursion Prof. amr

WITH C++ Prof. Amr Goneid AUC Part 12. Recursion Prof. amr Goneid, AUC 1 Recursion Prof. amr

CSCE 110 PROGRAMMING FUNDAMENTALS WITH C++ Prof. Amr Goneid AUC Part 12. Recursion Prof. amr Goneid, AUC 1 Recursion Prof. amr Goneid, AUC 2 Recursion Definition Examples from Math Functions Why Recursion Rules for

1.13k views • 57 slides
Recursion Summary Topics recursion overview simple examples Sierpinski

Recursion Summary Topics recursion overview simple examples Sierpinski

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

459 views • 24 slides

More recommend