1) count_down(count-1); printf("B%d\n", count); main (){ count_down(4); } Recursion 遞歸 3 Recursion A4 B A3 B3 A2 B2 A1 B1"> 1) count_down(count-1); printf("B%d\n", count); main (){ count_down(4); } Recursion 遞歸 3 Recursion A4 B A3 B3 A2 B2 A1 B1">

Presentation is loading. Please wait.

Presentation is loading. Please wait.

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",

Published byJosie Hendrickson Modified over 9 years ago

Similar presentations

Presentation on theme: "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","— Presentation transcript:

1 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", count); main (){ count_down(5); } A5 A4 A3 A2 A1 Recursion 遞歸 1 Recursion A5 count_down(4); B5 A4 count_down(3); B4 A3 count_down(2); B3 A2 count_down(1); B2 B1 B2 B3 B4 B5 A1 B1

2 countDown(4) countDown(3) printf("A%i", count); printf("B%i", count); countDown(2) printf("A%i", count); printf("B%i", count); countDown(1) printf("A%i", count); printf("B%i", count); A4 A3 A2 printf("A%i", count); printf("B%i", count); countDown(?) A1 B1 B2 B3 B4 2 Recursion A4 A3 A2 A1 B1 B2 B3 B4

3 void count_down (int count) { } printf("A%d\n", count); if(count>1) count_down(count-1); printf("B%d\n", count); main (){ count_down(4); } Recursion 遞歸 3 Recursion A4 B4 4 3 2 1 A3 B3 A2 B2 A1 B1

Download ppt "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","

Similar presentations

Complete Structure class Date {class Date { private :private : // private data and functions// private data and functions public :public : // public data.

Complete Structure class Date {class Date { private :private : // private data and functions// private data and functions public :public : // public data.
Selection Feature of C: Decision making statements: It allow us to take decisions as to which code is to be executed next. Since these statements control.

Selection Feature of C: Decision making statements: It allow us to take decisions as to which code is to be executed next. Since these statements control.
UNIT IV.

UNIT IV.
Continuation of chapter 6…. Nested while loop A while loop used within another while loop is called nested while loop. Q. An illustration to generate.

Continuation of chapter 6…. Nested while loop A while loop used within another while loop is called nested while loop. Q. An illustration to generate.
Discrete Maths Objective to describe the Big-Oh notation for estimating the running time of programs 242-213, Semester 2, 2013-2014 10. Running Time of.

Discrete Maths Objective to describe the Big-Oh notation for estimating the running time of programs , Semester 2, Running Time of.
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 ->
LIST PROCESSING.

LIST PROCESSING.
Program Looping EE2372 Software Design I Dr. Gerardo Rosiles.

Program Looping EE2372 Software Design I Dr. Gerardo Rosiles.
For(int i = 1; i

For(int i = 1; i
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,... /
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()
Programming In C++ Spring Semester 2013 Practice 1-3 Lectures Programming In C++, Lecture 3 By Umer Rana.

Programming In C++ Spring Semester 2013 Practice 1-3 Lectures Programming In C++, Lecture 3 By Umer Rana.
Part 1 Landscape Hannu Laine. Pointer parameters //prototype of swap void swap(int *a, int *b); //application void main(void) { in number1 = 1, number2.

Part 1 Landscape Hannu Laine. Pointer parameters //prototype of swap void swap(int *a, int *b); //application void main(void) { in number1 = 1, number2.
Selected Advanced Topics Chapter 7 and 8

Selected Advanced Topics Chapter 7 and 8
Counting Andreas Klappenecker. Counting k = 0; for(int i=1; i

Counting Andreas Klappenecker. Counting k = 0; for(int i=1; i
Buffer Overflow Prabhaker Mateti Wright State University.

Buffer Overflow Prabhaker Mateti Wright State University.
What is shape function ? shape function is a function that will give the displacements inside an element if its displacement at all the node locations.

What is shape function ? shape function is a function that will give the displacements inside an element if its displacement at all the node locations.
Recursion October 5, 2009. Reading Read pp 197-221 in the text.

Recursion October 5, Reading Read pp in the text.
§3 Dynamic Programming Use a table instead of recursion 1. Fibonacci Numbers: F(N) = F(N – 1) + F(N – 2) int Fib( int N ) { if ( N

§3 Dynamic Programming Use a table instead of recursion 1. Fibonacci Numbers: F(N) = F(N – 1) + F(N – 2) int Fib( int N ) { if ( N

Similar presentations

Ads by Google