Lecture5Functions,variablescopepointersStructured.ppt

* #include stdio.h void swapint(int *i, int *j) { int temp = i; i = j; j = temp; } int main(void) { int a = 10; int b = 20; swapint(a, b); printf(“a=%d b=%d\n, a, b); return 0; } Exercise: what will happen if the following program is executed? Recursion:重叠算法 Recursion is one way to decompose a task into smaller subtasks. At least one of the subtasks is a smaller example of the same task. The smallest example of the same task has a non-recursive solution. Example: The factorial function n! = n * (n-1) * (n-2) * ... * 1 or n! = n * (n-1)! and 1! = 1 * Recursion is like Russian Dolls * Recursion重叠算法: Example #include stdio.h int fac(int n){ // Assume n = 0 int product; if(n = 1) return 1; product = n * fac(n-1); return product; } void main(){ // driver function int number; do{ printf(Enter integer (negative to stop)”); scanf(“%d”, number); if(number = 0) printf(“%d\n”, fac(number)); }while(number = 0); } * Iterative（屡进，递增） Factorial // Non-recursive factorial function // Compute the factorial using a loop int fac(int n){ // Assume n = 0 int k, product; if(n =1) return 1; product = 1; for(k=1; k=n; k++) product*= k; return product; } * Recursion: Example 1 How to calculate exp(int x, int y) recursively? int exp(int x, int y){ if(y==0) return 1; return x * exp(x, y-1); } * Other Recursive example Fibonacci numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... where each number is the sum of the preceding two. Recursive definition: F(1) = 1 F(0) = 0 F(n) = F(n-1) + F(n-2) * Recursion: Example 4 Write a recursive function that counts the number of zero digits in a non-negative integer Example: zeros(10200) returns 3 int zeros(int n){ if(n==0) return 1; if(n 10) return 0; if(n%10 == 0) return 1 + zeros(n/10); else return zeros(n/10); } * Recursion: Example 5 Write a recursive function to determine how many factors m are part of n. For example, if n=48 and m=4, then the result is 2 (48=4*4*3). i