Presentation is loading. Please wait.

Presentation is loading. Please wait.

Joseph Lindo Recursion Sir Joseph Lindo University of the Cordilleras.

Published byMargaret Martin Modified over 9 years ago

Similar presentations

Presentation on theme: "Joseph Lindo Recursion Sir Joseph Lindo University of the Cordilleras."— Presentation transcript:

1 Joseph Lindo Recursion Sir Joseph Lindo University of the Cordilleras

2 Joseph Lindo Activity Application Definition No Iteration Recursion It is a programming technique in which a call to a method appears in that method’s body Once you understand recursive methods, they are often simpler to write than their iterative equivalents Definition

3 Joseph Lindo No Iteration Definition Activity Application Recursion vs Iteration Problem: Collect $1,000.00 for charity Assumption: Everyone is willing to donate a penny No Iteration

4 Joseph Lindo No Iteration Definition Activity Application Recursion vs Iteration Iterative Solution Visit 100,000 people, asking each for a penny Recursive Solution If you are asked to collect a penny, give a penny to the person who asked you for it No Iteration

5 Joseph Lindo No Iteration Definition Activity Application Recursion Basic Applications Application

6 Joseph Lindo Application No Iteration Definition Activity Recursion Group Activity Create the flow chart of a Fibonacci Sequence with the following conditions: 1 is always the start Accept the number of series to be printed from the user. Activity

7 Joseph Lindo Application No Iteration Definition Activity Recursion Assignment Create the flow chart of a simple Factorial in a one whole yellow paper, wherein the number must come from the user and there is no negative number. Activity

8 Joseph Lindo Recursion --end-- Sir Joseph Lindo University of the Cordilleras

9 Joseph Lindo Definition jo Factorial A factorial is defined as follows: n! = n * (n-1) * (n-2) …. * 1; For example: 1! = 1 (Base Case) 2! = 2 * 1 = 2 3! = 3 * 2 * 1 = 6 4! = 4 * 3 * 2 * 1 = 24 5! = 5 * 4 * 3 * 2 * 1 = 120 If you will study the examples you will start to see a pattern

10 Joseph Lindo Definition jo Factorial Example using the pattern 10 = 10 * 9! 5! = 5 * 4! 4! = 4 * 3!

11 Joseph Lindo Code jo Factorial Iterative approach: int factorial (int n) { int answer = 1; for (int i=1; i<=n; i++) answer *= i; return answer; }

12 Joseph Lindo Code jo Factorial Recursive approach: int factorial (int n) { if (n == 0) return 1; else return n * factorial(n-1); }

13 Joseph Lindo Definition jo Fibonacci Sequence The sequence begins with one Each subsequent number is the sum of the two preceding numbers Fib(n) = Fib(n-1) + Fib(n-2) 1, 1, 2, 3, 5, 8, 13...

14 Joseph Lindo Applications jo Fibonacci Sequence Many aspects of nature are grouped in bunches equaling Fibonacci numbers.

15 Joseph Lindo Applications jo Fibonacci Sequence Music involves several applications of Fibonacci numbers. A full octave is composed of 13 total musical tones, 8 of which make up the actual musical octave.

16 Joseph Lindo Applications jo Fibonacci Sequence Paintings

17 Joseph Lindo Applications jo Fibonacci Sequence Human Body The lengths of bones in a hand are Fibonacci numbers.

18 Joseph Lindo Diagram jo Fibonacci Sequence

19 Joseph Lindo Diagram jo Fibonacci Sequence

20 Joseph Lindo Diagram jo Fibonacci Sequence

21 Joseph Lindo Factorial More Fibonacci Sequence

Download ppt "Joseph Lindo Recursion Sir Joseph Lindo University of the Cordilleras."

Similar presentations

Tree Recursion Traditional Approach. Tree Recursion Consider the Fibonacci Number Sequence: Time: 0 1 2 3 4 5 6 7 8 0, 1, 1, 2, 3, 5, 8, 13, 21,... /

Tree Recursion Traditional Approach. Tree Recursion Consider the Fibonacci Number Sequence: Time: , 1, 1, 2, 3, 5, 8, 13, 21,... /
Dynamic Programming (DP)

Dynamic Programming (DP)
Recursion (define tell-story (lambda () (print ‘’Once upon a time there was a mountain. ‘’) (print ‘’On the mountain, there was a temple. ‘’) (print ‘’In.

Recursion (define tell-story (lambda () (print ‘’Once upon a time there was a mountain. ‘’) (print ‘’On the mountain, there was a temple. ‘’) (print ‘’In.
Recursion. Binary search example postponed to end of lecture.

Recursion. Binary search example postponed to end of lecture.
Slides prepared by Rose Williams, Binghamton University Chapter 11 Recursion.

Slides prepared by Rose Williams, Binghamton University Chapter 11 Recursion.
Topic 7 – Recursion (A Very Quick Look). CISC 105 – Topic 7 What is Recursion? A recursive function is a function that calls itself. Recursive functions.

Topic 7 – Recursion (A Very Quick Look). CISC 105 – Topic 7 What is Recursion? A recursive function is a function that calls itself. Recursive functions.
 2003 Prentice Hall, Inc. All rights reserved. 1 Chapter 3 - Functions Outline 3.12Recursion 3.13Example Using Recursion: The Fibonacci Series 3.14Recursion.

 2003 Prentice Hall, Inc. All rights reserved. 1 Chapter 3 - Functions Outline 3.12Recursion 3.13Example Using Recursion: The Fibonacci Series 3.14Recursion.
FIT1002 2006 1 FIT1002 Computer Programming Unit 20 Recursion.

FIT FIT1002 Computer Programming Unit 20 Recursion.
1 CSE1301 Computer Programming Lecture 27 Recursion (Part 1)

1 CSE1301 Computer Programming Lecture 27 Recursion (Part 1)
Chapter 15 Recursive Algorithms. 2 Recursion Recursion is a programming technique in which a method can call itself to solve a problem A recursive definition.

Chapter 15 Recursive Algorithms. 2 Recursion Recursion is a programming technique in which a method can call itself to solve a problem A recursive definition.
Simple Recursion. COMP104 Lecture 35 / Slide 2 Recursion: Example 0 * What does the following program do? #include using namespace std; int fac(int n){

Simple Recursion. COMP104 Lecture 35 / Slide 2 Recursion: Example 0 * What does the following program do? #include using namespace std; int fac(int n){
7.5 Use Recursive Rules with Sequences and Functions

7.5 Use Recursive Rules with Sequences and Functions
The sequence begins with one. Each subsequent number is the sum of the two preceding numbers. The sequence begins with one. Each subsequent number is.

The sequence begins with one. Each subsequent number is the sum of the two preceding numbers. The sequence begins with one. Each subsequent number is.
 2000 Prentice Hall, Inc. All rights reserved. Chapter 5 – Recursive Funtions From Deitel’s “C” Book 5.13Recursion 5.14Example Using Recursion: The Fibonacci.

 2000 Prentice Hall, Inc. All rights reserved. Chapter 5 – Recursive Funtions From Deitel’s “C” Book 5.13Recursion 5.14Example Using Recursion: The Fibonacci.
CS212: DATASTRUCTURES Lecture 3: Recursion 1. Lecture Contents 2  The Concept of Recursion  Why recursion?  Factorial – A case study  Content of a.

CS212: DATASTRUCTURES Lecture 3: Recursion 1. Lecture Contents 2  The Concept of Recursion  Why recursion?  Factorial – A case study  Content of a.
1 Chapter 18-1 Recursion Dale/Weems. 2 Chapter 18 Topics l Meaning of Recursion l Base Case and General Case in Recursive Function Definitions l Writing.

1 Chapter 18-1 Recursion Dale/Weems. 2 Chapter 18 Topics l Meaning of Recursion l Base Case and General Case in Recursive Function Definitions l Writing.
Copyright 2003 Scott/Jones Publishing Standard Version of Starting Out with C++, 4th Edition Chapter 19 Recursion.

Copyright 2003 Scott/Jones Publishing Standard Version of Starting Out with C++, 4th Edition Chapter 19 Recursion.
Recursion.

Recursion.
Recursion. Basic problem solving technique is to divide a problem into smaller subproblems These subproblems may also be divided into smaller subproblems.

Recursion. Basic problem solving technique is to divide a problem into smaller subproblems These subproblems may also be divided into smaller subproblems.
C++ Beginner Tutorial: Functions IV Recursion. What is recursion? A property of function to be able to call itself… Get factorial of a given number: Factorial.

C++ Beginner Tutorial: Functions IV Recursion. What is recursion? A property of function to be able to call itself… Get factorial of a given number: Factorial.

Similar presentations

Ads by Google