Presentation is loading. Please wait.

Presentation is loading. Please wait.

Int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 5 void main () { Int Sum; : Sum = fact (5); : } Factorial Program Using Recursion.

Published byLauren Fisher Modified over 9 years ago

Similar presentations

Presentation on theme: "Int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 5 void main () { Int Sum; : Sum = fact (5); : } Factorial Program Using Recursion."— Presentation transcript:

1 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 5 void main () { Int Sum; : Sum = fact (5); : } Factorial Program Using Recursion 55 5

2 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 5 5 55 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); }

3 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 544 4 4 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); }

4 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 543 3 3 3 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); }

5 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 543 2 2 2 2 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); }

6 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 543 2 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 1 11 1

7 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 543 2 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 1 0 0 1

8 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 543 2 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 11 1

9 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 543 2 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 11 1 2

10 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 5 43 2 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 11 1 2 6

11 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 543 2 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 11 1 2 624

12 int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } void main () { Int Sum; : Sum = fact (5); : } 120 24 5

Download ppt "Int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 5 void main () { Int Sum; : Sum = fact (5); : } Factorial Program Using Recursion."

Similar presentations

©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 15 Recursive Algorithms.

©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 15 Recursive Algorithms.
Recursion.

Recursion.
Recursion.

Recursion.
Recursive Descent Technique CMSC 331. UMBC 2 The Header /* This program matches the following A -> B { '|' B } B -> C { '&' C } C -> D { '^' D } D ->

Recursive Descent Technique CMSC 331. UMBC 2 The Header /* This program matches the following A -> B { '|' B } B -> C { '&' C } C -> D { '^' D } D ->
For(int i = 1; i

For(int i = 1; i
Introduction to Computer Science Robert Sedgewick and Kevin Wayne Copyright © 2006 Recursive GCD Demo public class.

Introduction to Computer Science Robert Sedgewick and Kevin Wayne Copyright © Recursive GCD Demo public class.
Introduction to Computer Science Robert Sedgewick and Kevin Wayne Recursive Factorial Demo pubic class Factorial {

Introduction to Computer Science Robert Sedgewick and Kevin Wayne Recursive Factorial Demo pubic class Factorial {
Recursion Prog #include <stdio.h> #include<conio.h> main()

Recursion Prog #include <stdio.h> #include<conio.h> main()
Pass by Value. COMP104 Pass by Value / Slide 2 Passing Parameters by Value * A function returns a single result (assuming the function is not a void function)

Pass by Value. COMP104 Pass by Value / Slide 2 Passing Parameters by Value * A function returns a single result (assuming the function is not a void function)
Factorial Preparatory Exercise #include using namespace std; double fact(double); int fact(int); int main(void) { const int n=20; ofstream my_file(results.txt);

Factorial Preparatory Exercise #include using namespace std; double fact(double); int fact(int); int main(void) { const int n=20; ofstream my_file("results.txt");
9 x9 81 4/12/2015 Know Your Facts!. 9 x2 18 4/12/2015 Know Your Facts!

9 x9 81 4/12/2015 Know Your Facts!. 9 x2 18 4/12/2015 Know Your Facts!
5432154321 void count_down (int count) { for(i=count; i>1; i--) printf( %d\t, count); } printf(A%d\n, count); if(count>1) count_down(count-1); printf(B%d\n,

void count_down (int count) { for(i=count; i>1; i--) printf(" %d\t", count); } printf("A%d\n", count); if(count>1) count_down(count-1); printf("B%d\n",
1 x0 0 4/15/2015 Know Your Facts!. 9 x1 9 4/15/2015 Know Your Facts!

1 x0 0 4/15/2015 Know Your Facts!. 9 x1 9 4/15/2015 Know Your Facts!
1 x0 0 4/16/2015 Know Your Facts!. 1 x8 8 4/16/2015 Know Your Facts!

1 x0 0 4/16/2015 Know Your Facts!. 1 x8 8 4/16/2015 Know Your Facts!
Divisor máximo de dois inteiros. unsigned int gcd(unsigned int A, unsigned int B) { if (B > A) return gcd(B,A); else if (B==0) return A; else return gcd(B,A%B);}

Divisor máximo de dois inteiros. unsigned int gcd(unsigned int A, unsigned int B) { if (B > A) return gcd(B,A); else if (B==0) return A; else return gcd(B,A%B);}
3 x0 0 7/18/2015 Know Your Facts!. 4 x3 12 7/18/2015 Know Your Facts!

3 x0 0 7/18/2015 Know Your Facts!. 4 x3 12 7/18/2015 Know Your Facts!
Lecture 4 1) RECURSION 2)BACKTRACKING 3)LOOK AHEAD.

Lecture 4 1) RECURSION 2)BACKTRACKING 3)LOOK AHEAD.
Recursion CS-240/CS341. What is recursion? a function calls itself –direct recursion a function calls its invoker –indirect recursion f f1 f2.

Recursion CS-240/CS341. What is recursion? a function calls itself –direct recursion a function calls its invoker –indirect recursion f f1 f2.
Introduction to C Programming CE00312-1 Lecture 21 Recursion and Linear Linked Lists.

Introduction to C Programming CE Lecture 21 Recursion and Linear Linked Lists.
Recursion. Idea: Some problems can be broken down into smaller versions of the same problem Example: n! 1*2*3*…*(n-1)*n n*factorial of (n-1)

Recursion. Idea: Some problems can be broken down into smaller versions of the same problem Example: n! 1*2*3*…*(n-1)*n n*factorial of (n-1)

Similar presentations

Ads by Google