recursion announcements recursive functions recursive
play

Recursion Announcements Recursive Functions Recursive Functions 4 - PowerPoint PPT Presentation

Aug 19, 2022 •218 likes •1.11k views

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. Recursion

  2. Announcements

  3. Recursive Functions

  4. Recursive Functions � 4

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

  6. 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 function � 4

  7. 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 function � 4

  8. 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 function Drawing Hands, by M. C. Escher (lithograph, 1948) � 4

  9. Digit Sums 2+0+1+9 = 12 � 5

  10. Digit Sums 2+0+1+9 = 12 • If a number a is divisible by 9, then sum_digits(a) is also divisible by 9 � 5

  11. Digit Sums 2+0+1+9 = 12 • If a number a is divisible by 9, then sum_digits(a) is also divisible by 9 • Useful for typo detection! � 5

  12. Digit Sums 2+0+1+9 = 12 • If a number a is divisible by 9, then sum_digits(a) is also divisible by 9 • Useful for typo detection! The Bank of 61A 1234 5678 9098 7658 OSKI THE BEAR � 5

  13. Digit Sums 2+0+1+9 = 12 • If a number a is divisible by 9, then sum_digits(a) is also divisible by 9 • Useful for typo detection! The Bank of 61A A checksum digit is a function of all the other 1234 5678 9098 7658 digits; It can be computed to detect typos OSKI THE BEAR � 5

  14. Digit Sums 2+0+1+9 = 12 • If a number a is divisible by 9, then sum_digits(a) is also divisible by 9 • Useful for typo detection! The Bank of 61A A checksum digit is a function of all the other 1234 5678 9098 7658 digits; It can be computed to detect typos OSKI THE BEAR • Credit cards actually use the Luhn algorithm, which we'll implement after sum_digits � 5

  15. The Problem Within the Problem The sum of the digits of 6 is 6. Likewise for any one-digit (non-negative) number (i.e., < 10). The sum of the digits of 2019 is 201 9 Sum of these digits + This digit That is, we can break the problem of summing the digits of 2019 into a smaller instance of the same problem, plus some extra stuff. We call this recursion � 6

  16. Sum Digits Without a While Statement � 7

  17. Sum Digits Without a While Statement def split(n): """Split positive n into all but its last digit and its last digit.""" return n // 10, n % 10 � 7

  18. Sum Digits Without a While Statement def split(n): """Split positive n into all but its last digit and its last digit.""" return n // 10, n % 10 def sum_digits(n): """Return the sum of the digits of positive integer n.""" � 7

  19. Sum Digits Without a While Statement def split(n): """Split positive n into all but its last digit and its last digit.""" return n // 10, n % 10 def sum_digits(n): """Return the sum of the digits of positive integer n.""" if n < 10: return n � 7

  20. Sum Digits Without a While Statement def split(n): """Split positive n into all but its last digit and its last digit.""" return n // 10, n % 10 def sum_digits(n): """Return the sum of the digits of positive integer n.""" if n < 10: return n else: all_but_last, last = split(n) � 7

  21. Sum Digits Without a While Statement def split(n): """Split positive n into all but its last digit and its last digit.""" return n // 10, n % 10 def sum_digits(n): """Return the sum of the digits of positive integer n.""" if n < 10: return n else: all_but_last, last = split(n) return sum_digits(all_but_last) + last � 7

  22. The Anatomy of a Recursive Function def sum_digits(n): """Return the sum of the digits of positive integer n.""" if n < 10: return n else: all_but_last, last = split(n) return sum_digits(all_but_last) + last � 8

  23. The Anatomy of a Recursive Function • The def statement header is similar to other functions def sum_digits(n): """Return the sum of the digits of positive integer n.""" if n < 10: return n else: all_but_last, last = split(n) return sum_digits(all_but_last) + last � 8

  24. The Anatomy of a Recursive Function • The def statement header is similar to other functions def sum_digits(n): """Return the sum of the digits of positive integer n.""" if n < 10: return n else: all_but_last, last = split(n) return sum_digits(all_but_last) + last � 8

  25. The Anatomy of a Recursive Function • The def statement header is similar to other functions • Conditional statements check for base cases def sum_digits(n): """Return the sum of the digits of positive integer n.""" if n < 10: return n else: all_but_last, last = split(n) return sum_digits(all_but_last) + last � 8

  26. The Anatomy of a Recursive Function • The def statement header is similar to other functions • Conditional statements check for base cases def sum_digits(n): """Return the sum of the digits of positive integer n.""" if n < 10: return n else: all_but_last, last = split(n) return sum_digits(all_but_last) + last � 8

  27. The Anatomy of a Recursive Function • The def statement header is similar to other functions • Conditional statements check for base cases • Base cases are evaluated without recursive calls def sum_digits(n): """Return the sum of the digits of positive integer n.""" if n < 10: return n else: all_but_last, last = split(n) return sum_digits(all_but_last) + last � 8

  28. The Anatomy of a Recursive Function • The def statement header is similar to other functions • Conditional statements check for base cases • Base cases are evaluated without recursive calls def sum_digits(n): """Return the sum of the digits of positive integer n.""" if n < 10: return n else: all_but_last, last = split(n) return sum_digits(all_but_last) + last � 8

  29. The Anatomy of a Recursive Function • The def statement header is similar to other functions • Conditional statements check for base cases • Base cases are evaluated without recursive calls • Recursive cases are evaluated with recursive calls def sum_digits(n): """Return the sum of the digits of positive integer n.""" if n < 10: return n else: all_but_last, last = split(n) return sum_digits(all_but_last) + last � 8

  30. The Anatomy of a Recursive Function • The def statement header is similar to other functions • Conditional statements check for base cases • Base cases are evaluated without recursive calls • Recursive cases are evaluated with recursive calls def sum_digits(n): """Return the sum of the digits of positive integer n.""" if n < 10: return n else: all_but_last, last = split(n) return sum_digits(all_but_last) + last � 8

  31. The Anatomy of a Recursive Function • The def statement header is similar to other functions • Conditional statements check for base cases • Base cases are evaluated without recursive calls • Recursive cases are evaluated with recursive calls def sum_digits(n): """Return the sum of the digits of positive integer n.""" if n < 10: return n else: all_but_last, last = split(n) return sum_digits(all_but_last) + last (Demo) � 8

  32. Recursion in Environment Diagrams

  33. Recursion in Environment Diagrams � 10 http://pythontutor.com/composingprograms.html#code=def%20fact%28n%29%3A%0A%20%20%20%20if%20n%20%3D%3D%200%3A%0A%20%20%20%20%20%20%20%20return%201%0A%20%20%20%20else%3A%0A%20%20%20%20%20%20%20%20return%20n%20*%20fact%28n%20-%201%29%0A%20%20%20%20%20%20%20%20%0Afact%283%29&cumulative=true&curInstr=0&mode=display&origin=composingprograms.js&py=3&rawInputLstJSON=%5B%5D

  34. Recursion in Environment Diagrams (Demo) � 10 http://pythontutor.com/composingprograms.html#code=def%20fact%28n%29%3A%0A%20%20%20%20if%20n%20%3D%3D%200%3A%0A%20%20%20%20%20%20%20%20return%201%0A%20%20%20%20else%3A%0A%20%20%20%20%20%20%20%20return%20n%20*%20fact%28n%20-%201%29%0A%20%20%20%20%20%20%20%20%0Afact%283%29&cumulative=true&curInstr=0&mode=display&origin=composingprograms.js&py=3&rawInputLstJSON=%5B%5D

  35. Recursion in Environment Diagrams (Demo) � 10 http://pythontutor.com/composingprograms.html#code=def%20fact%28n%29%3A%0A%20%20%20%20if%20n%20%3D%3D%200%3A%0A%20%20%20%20%20%20%20%20return%201%0A%20%20%20%20else%3A%0A%20%20%20%20%20%20%20%20return%20n%20*%20fact%28n%20-%201%29%0A%20%20%20%20%20%20%20%20%0Afact%283%29&cumulative=true&curInstr=0&mode=display&origin=composingprograms.js&py=3&rawInputLstJSON=%5B%5D

Recommend

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
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
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 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
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
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
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
Chapter 3: Chapter 3: Primitive Recursive Primitive Recursive Functions Functions M. Farshi

Chapter 3: Chapter 3: Primitive Recursive Primitive Recursive Functions Functions M. Farshi

Computer Science Theory (Master Course) Yazd Univ. Chapter 3: Chapter 3: Primitive Recursive Primitive Recursive Functions Functions M. Farshi Composition- Mohammad Farshi Recursion Recursion Department of Computer Science PRC Classes

499 views • 26 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
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
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 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
Week 3 recap Need to know for this course Recursion Be very comfortable with recursive

Week 3 recap Need to know for this course Recursion Be very comfortable with recursive

Week 3 recap Need to know for this course Recursion Be very comfortable with recursive definitions Recursive datatypes and functions Know how to do structural induction Induction and structural induction 1 2 Summary of topics Well-formed

754 views • 39 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
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
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
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
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 Ali Taheri Sharif University of Technology Fall 2018 Outline 1. Recursive Functions

Recursion Ali Taheri Sharif University of Technology Fall 2018 Outline 1. Recursive Functions

Fu Fundamentals of Pr Programming (Py Python) Recursion Ali Taheri Sharif University of Technology Fall 2018 Outline 1. Recursive Functions 2. Example: Fibonacci 3. Memoization 4. Example: Binomial Coefficient 5. Example: Towers of

264 views • 12 slides
CS20a: Models (Nov 14, 2002) Alternative models Primitive recursive functions Partial

CS20a: Models (Nov 14, 2002) Alternative models Primitive recursive functions Partial

CS20a: Models (Nov 14, 2002) Alternative models Primitive recursive functions Partial recursive functions Recursion theorem Rices theorem Lambda Calculus Recursion theorem Rices theorem Arithmetic

441 views • 30 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
Partial Recursive Functions and Finality Gordon Plotkin Laboratory for the Foundations of

Partial Recursive Functions and Finality Gordon Plotkin Laboratory for the Foundations of

Introduction Natural numbers objects in monoidal categories Weak representability of partial recursive functions Strong representability of partial recursive functions Partial Recursive Functions and Finality Gordon Plotkin Laboratory for the

800 views • 58 slides

More recommend