recursive thinking
play

Recursive Thinking Define the solution to a problem in terms of a - PowerPoint PPT Presentation

Mar 06, 2023 •440 likes •561 views

CS Lunch Mark Floryan UMass How can video games help humans and computers learn from one another? Wednesday, April 17, 12:15 Kendade 307 1 Senior Symposium, Friday Elicitation of Gestures for The Weil Zeta Function for Image Editing

  1. CS Lunch Mark Floryan UMass How can video games help humans and computers learn from one another? Wednesday, April 17, 12:15 Kendade 307 1 Senior Symposium, Friday Elicitation of Gestures for The Weil Zeta Function for Image Editing Curves Andreea Bancila Vy Nguyen 4:15, Cleveland L1 3:45, Cleveland L1 2 Recursive Thinking Define the solution to a problem in terms of a solution to one or more “smaller” subproblems Define a base case, a subproblem that can be solved directly. 3 Monday, April 15, 13

  2. Factorial � private int factorial (int n) { � � assert n >= 0; � � � � if (n == 0) { Base case � � � return 1; � � } � � � � return n * factorial(n-1); Smaller � } subproblem � Solution to recursive case 4 Tabletop Roleplaying http:/ /xkcd.com/244/ 5 Recursive Structures Define a data structure as a piece of data followed by a smaller data structure of the same type Define a base case, a trivial piece of data with nothing following it. 6 Monday, April 15, 13

  3. Drawing with the Mouse 7 Drawing with the Mouse Lots of short lines! Call one group of connected lines a “scribble” 8 What is a Scribble? A line segment, followed by A shorter Scribble Base case: an “empty” scribble 9 Monday, April 15, 13

  4. Scribble Hierarchy <<interface>> Scribble Recursive Empty Scribble Scribble 10 RecursiveScribble public class RecursiveScribble implements Scribble { / / This line private Line2D line; private Color color; / / The lines that follow it private Scribble rest; / / Methods ... } 11 EmptyScribble public class EmptyScribble implements Scribble { / / No instance variables!! / / Methods ... } 12 Monday, April 15, 13

  5. Scribble Structure selectedScribble RecursiveScribble line white line white objects line white line white EmptyScribble object line white 13 Changing the Color of a Scribble in RecursiveScribble: public void setColor (Color newColor) { / / Change the color of this line color = newColor; / / Recursively change the rest of the scribble rest.setColor (newColor); } in EmptyScribble: public void setColor (Color newColor) { / / Nothing to do! } 14 Calling setColor on Scribble Structure selectedScribble line red color = newColor; line white line white line white 15 Monday, April 15, 13

  6. Calling setColor on Scribble Structure selectedScribble line red rest.setColor (newColor); line red line white line white 16 Calling setColor on Scribble Structure selectedScribble line red rest.setColor (newColor); line red line red line white 17 Calling setColor on Scribble Structure selectedScribble line red rest.setColor (newColor); line red line red line red 18 Monday, April 15, 13

  7. Calling setColor on Scribble Structure selectedScribble line red line red setColor in EmptyScribble does line red nothing! line red 19 Broccoli 20 Broccoli Base case => Flower Smaller substructure => 3 More pieces of broccoli Little data => Stem 21 Monday, April 15, 13

  8. Towers of Hanoi End of the world in 585 billion years! http:/ / en.wikipedia.org/wiki/Tower_of_Hanoi 22 More Recursion Humor http:/ / www.thinkgeek.com/ images/products/zoom/ b2ae_recursion.jpg 23 Finding a Path in a Maze Start End 24 Monday, April 15, 13

  9. Recursion! What are the subproblems? Take 1 step, then search from that step to the end. What is the base case? Reached the end 25 Solving public boolean findMazePath() { return findMazePath(0, 0); a Maze } public boolean findMazePath (int x, int y) { if (no new neighbors to visit) { return false; } if ( (x, y) is at the goal) { return true; } else if (findMazePath (x-1, y) || findMazePath (x+1, y) || …) { return true; } else { return false; } 26 } Stacks & Start Backtracking Recursing findMazePath(0,4) findMazePath(0,3) findMazePath(0,2) End findMazePath(0,1) findMazePath(0,0) 27 Monday, April 15, 13

  10. Stacks & Start Backtracking Dead end - backtrack findMazePath(0,4) findMazePath(0,3) findMazePath(0,2) End findMazePath(0,1) findMazePath(0,0) 28 Stacks & Start Backtracking Recurse in a different direction findMazePath(1,3) findMazePath(0,3) findMazePath(0,2) End findMazePath(0,1) findMazePath(0,0) 29 Eight Queens Place 8 queens on a chessboard such that no queen can capture any other queen. FAIL!! 30 Monday, April 15, 13

  11. Success! 31 Sudoku 32 Monday, April 15, 13

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
Recursive Thinking Define the solution to a problem in terms of a solution to one or more

Recursive Thinking Define the solution to a problem in terms of a solution to one or more

Senior Symposium, Friday Elicitation of Gestures for The Weil Zeta Function for Image Editing Curves Andreea Bancila Vy Nguyen 4:15, Cleveland L1 3:45, Cleveland L1 1 Recursive Thinking Define the solution to a problem in terms of a

306 views • 4 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
Recursive Methods Recursive problem solution Problems that are naturally solved by

Recursive Methods Recursive problem solution Problems that are naturally solved by

Recursive Methods Recursive problem solution Problems that are naturally solved by recursion Derivative of rational function Recursive Methods Examples: Recursive function: Fibonacci numbers Recursive graphics:

284 views • 5 slides
61A Lecture 6 Announcements Recursive Functions Recursive Functions 4 Recursive Functions

61A Lecture 6 Announcements Recursive Functions Recursive Functions 4 Recursive Functions

61A Lecture 6 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.08k views • 88 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
Lesson 9 Recursive Types 2/19, 21 Chapters 20, 21 Recursive type Recursive type terms are

Lesson 9 Recursive Types 2/19, 21 Chapters 20, 21 Recursive type Recursive type terms are

Lesson 9: Recursive Types Lesson 9 Recursive Types 2/19, 21 Chapters 20, 21 Recursive type Recursive type terms are infinite, but regular For finite terms, use induction based on least fixed points For infinite terms/trees, we

232 views • 7 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
Assessing the Stability of Forecasting Models: Recursive Parameter Estimation and Recursive

Assessing the Stability of Forecasting Models: Recursive Parameter Estimation and Recursive

Assessing the Stability of Forecasting Models: Recursive Parameter Estimation and Recursive Residuals At each t, t = k, ... ,T-1, compute: Recursive parameter est. and forecast: Recursive residual: If all is well: Sequence of 1-step forecast

650 views • 39 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
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
OUTLINE CHAPTER 10 Recursive Hierarchies Table of contents Recursive Hierarchies and Bridges

OUTLINE CHAPTER 10 Recursive Hierarchies Table of contents Recursive Hierarchies and Bridges

OUTLINE CHAPTER 10 Recursive Hierarchies Table of contents Recursive Hierarchies and Bridges Reporting Challenge Flattening a Recursive Hierarchy The Hierarchy Bridge Double Counting Resolving Many to Many Dinesh Maharjan

401 views • 13 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
Non-Recursive In-Place FFT Algorithm Idea: &quot;Unwind the in-place recursive algorithm and work

Non-Recursive In-Place FFT Algorithm Idea: &quot;Unwind the in-place recursive algorithm and work

Non-Recursive In-Place FFT Algorithm Idea: &quot;Unwind the in-place recursive algorithm and work bottom up from a bit-reversed input array in a &quot;butterfly&quot; pattern: - 1 - (non-recursive in-place FFT algorithm continued) Non-recursive

436 views • 5 slides
Recursive Analysis And Real Recursive Functions Emmanuel Hainry Joint work with Olivier Bournez

Recursive Analysis And Real Recursive Functions Emmanuel Hainry Joint work with Olivier Bournez

Recursive Analysis And Real Recursive Functions Emmanuel Hainry Joint work with Olivier Bournez LORIA/INPL, Nancy, France Feb. 13, 2006 1/29 Introduction Definitions Recursive functions Limit operator Conclusion 1. Introduction Context

399 views • 29 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
ECSEL JU IMPACT OF FUNDING TOOLS BERT DE COLVENAER THINKING TOGETHER THINKING TOGETHER

ECSEL JU IMPACT OF FUNDING TOOLS BERT DE COLVENAER THINKING TOGETHER THINKING TOGETHER

ECSEL JU IMPACT OF FUNDING TOOLS BERT DE COLVENAER THINKING TOGETHER THINKING TOGETHER THINKING TOGETHER THINKING TOGETHER WORKING TOGETHER 3Ccar CAMMI DENSE ENLIGHT iFEST ME3GAS PARSIMO RobustSENSE SYSMODEL 3DAM CESAR DESERVE

738 views • 11 slides
Python: Recursive Functions Recursive Functions Recall factorial function: Iterative Algorithm

Python: Recursive Functions Recursive Functions Recall factorial function: Iterative Algorithm

Python: Recursive Functions Recursive Functions Recall factorial function: Iterative Algorithm Loop construct (while) can capture computation in a set of state variables that update on each iteration through loop Recursive Functions

376 views • 22 slides
One-Slide Summary List Recursion Examples &amp; Recursive Procedures Recursive functions

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

One-Slide Summary List Recursion Examples &amp; 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
ALL THINGS Lindy Strong DNA &amp; OUR THINKING DNA &amp; Our Thinking The following section

ALL THINGS Lindy Strong DNA &amp; OUR THINKING DNA &amp; Our Thinking The following section

RESTORATION OF ALL THINGS Lindy Strong DNA &amp; OUR THINKING DNA &amp; Our Thinking The following section has several quotes directly for this book It also contains a 21 day brain detox plan DNA &amp; Our Thinking To quote Caroline

1.4k views • 106 slides
Search Algorithms 15-110 - Monday 2/24 Learning Objectives Trace over recursive functions

Search Algorithms 15-110 - Monday 2/24 Learning Objectives Trace over recursive functions

Search Algorithms 15-110 - Monday 2/24 Learning Objectives Trace over recursive functions that use multiple recursive calls with Towers of Hanoi Recognize linear search on lists and in recursive contexts Use binary search when reading

465 views • 30 slides
The Representability of Partial Recursive Yan Steimle Functions in Arithmetical Theories and

The Representability of Partial Recursive Yan Steimle Functions in Arithmetical Theories and

Representing Recursive Functions The Representability of Partial Recursive Yan Steimle Functions in Arithmetical Theories and Definitions Main Categories theorems Statements Proof Total recursive functions Yan Steimle Conclusion

574 views • 32 slides
BILL MARTIN Designing a Comprehensive Thinking Program: Blending Thinking Skills and

BILL MARTIN Designing a Comprehensive Thinking Program: Blending Thinking Skills and

BILL MARTIN Designing a Comprehensive Thinking Program: Blending Thinking Skills and Dispositions CONFERENCE ON THINKING NORDIC FOLLOW-UP SWEDEN - OCTOBER 2008 DO YOU KNOW A THINKING SCHOOL? WHY NOT? The thinker has left!

790 views • 29 slides

More recommend