61a lecture 6 announcements recursive functions recursive
play

61A Lecture 6 Announcements Recursive Functions Recursive - PowerPoint PPT Presentation

Oct 31, 2022 •199 likes •1.08k views

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. 61A Lecture 6

  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+5 = 8 5

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

  11. Digit Sums 2+0+1+5 = 8 • 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+5 = 8 • 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+5 = 8 • 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+5 = 8 • 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 digit_sum 5

  15. Sum Digits Without a While Statement 6

  16. 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 6

  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 def sum_digits(n): """Return the sum of the digits of positive integer n.""" 6

  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.""" if n < 10: return n 6

  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 else: all_but_last, last = split(n) 6

  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) return sum_digits(all_but_last) + last 6

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

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

  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 7

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

  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 7

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

  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 7

  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 • 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 7

  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 7

  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 (Demo) 7

  31. Recursion in Environment Diagrams

  32. Recursion in Environment Diagrams Interactive Diagram 9

  33. Recursion in Environment Diagrams (Demo) Interactive Diagram 9

  34. Recursion in Environment Diagrams (Demo) Interactive Diagram 9

  35. Recursion in Environment Diagrams (Demo) • The same function fact is called multiple times Interactive Diagram 9

  36. Recursion in Environment Diagrams (Demo) • The same function fact is called multiple times Interactive Diagram 9

  37. Recursion in Environment Diagrams (Demo) • The same function fact is called multiple times • Different frames keep track of the different arguments in each call Interactive Diagram 9

  38. Recursion in Environment Diagrams (Demo) • The same function fact is called multiple times • Different frames keep track of the different arguments in each call • What n evaluates to depends upon 
 the current environment Interactive Diagram 9

  39. Recursion in Environment Diagrams (Demo) • The same function fact is called multiple times • Different frames keep track of the different arguments in each call • What n evaluates to depends upon 
 the current environment Interactive Diagram 9

  40. Recursion in Environment Diagrams (Demo) • The same function fact is called multiple times • Different frames keep track of the different arguments in each call • What n evaluates to depends upon 
 the current environment • Each call to fact solves a simpler problem than the last: smaller n Interactive Diagram 9

  41. Iteration vs Recursion 10

  42. Iteration vs Recursion Iteration is a special case of recursion 10

  43. Iteration vs Recursion Iteration is a special case of recursion 4! = 4 · 3 · 2 · 1 = 24 10

  44. Iteration vs Recursion Iteration is a special case of recursion 4! = 4 · 3 · 2 · 1 = 24 Using while: 10

Recommend

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
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
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
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
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
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
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 Definitions Generating Functions Lecture 18 Generating Functions A generating

Recursive Definitions Generating Functions Lecture 18 Generating Functions A generating

Recursive Definitions Generating Functions Lecture 18 Generating Functions A generating function is an alternate representation of an infinite sequence, which allows making useful deductions about the sequence (including, possibly, a closed

865 views • 17 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
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
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
Representation of Partial Recursive Functions by Inductive-Recursive and by Inductive

Representation of Partial Recursive Functions by Inductive-Recursive and by Inductive

Representation of Partial Recursive Functions by Inductive-Recursive and by Inductive Definitions Anton Setzer Swansea University Anton Setzer: Representation of part.-rec. functions by ind.-recursive and by ind. definitions 1 Principle of

676 views • 10 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
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
Model Finding for Recursive Functions in SMT Andrew Reynolds Jasmin Christian Blanchette Cesare

Model Finding for Recursive Functions in SMT Andrew Reynolds Jasmin Christian Blanchette Cesare

Model Finding for Recursive Functions in SMT Andrew Reynolds Jasmin Christian Blanchette Cesare Tinelli SMT July 18, 2015 Recursive Functions Recursive function definitions: f( x:Int ) := if x0 then 0 else f(x -1)+x Are useful in

523 views • 39 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
AMath 483/583 Lecture 20 Notes: Outline: Adaptive quadrature, recursive functions

AMath 483/583 Lecture 20 Notes: Outline: Adaptive quadrature, recursive functions

AMath 483/583 Lecture 20 Notes: Outline: Adaptive quadrature, recursive functions Load balancing with OpenMP nested forking Code: $UWHPSC/codes/adaptive_quadrature R.J. LeVeque, University of Washington AMath 483/583,

364 views • 7 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
Recursive f(b) explicitly for each base case b R Functions f(c(x)) for each

Recursive f(b) explicitly for each base case b R Functions f(c(x)) for each

Recursive Function To define a function, f, on a recursively defined set R, define Recursive f(b) explicitly for each base case b R Functions f(c(x)) for each constructor, c, in terms of x and f(x) recursivef recursivefunctions.1

448 views • 5 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
61A Lecture 31 Recursive art contest entries will be due Monday 12/2 @ 11:59pm (After

61A Lecture 31 Recursive art contest entries will be due Monday 12/2 @ 11:59pm (After

Announcements Project 4 due Thursday 11/21 @ 11:59pm. Extra reader office hours in 405 Soda this week. ! Wednesday: 5:30pm-7pm ! Thursday: 5:30pm-7pm Homework 10 due Tuesday 11/26 @ 11:59pm. 61A Lecture 31 Recursive art contest

150 views • 4 slides
Flat Domains and Recursive Equations in ACL2 by John Cowles University of Wyoming 1 ACL2 is a

Flat Domains and Recursive Equations in ACL2 by John Cowles University of Wyoming 1 ACL2 is a

Flat Domains and Recursive Equations in ACL2 by John Cowles University of Wyoming 1 ACL2 is a logic of total functions. Some recursive equations have no satisfying ACL2 functions: No ACL2 function g satisfies this recursive equation

518 views • 35 slides

More recommend