Ch01 INTRODUCTION(数据结构外文版)1.pptVIP

CHAPTER 1: INTRODUCTION See that how a program performs for reasonably large input is just as important as its performance on moderate amounts of input. Briefly review recursion. 1.1. Whats the Book About? * Data Structures And Algorithm Analysis In C Lectured by Qu Bo Second Edition int f( int x ) { /*1*/ if ( x = 0 ) /*2*/ return 0; else /*3*/ return( 2*f(x-1) + x*x ); } Figure 1.2 A recursive function 1.2. A Brief Introduction to Recursion int bad( unsigned int n ) { /*1*/ if (n == 0) /*2*/ return 0; else /*3*/ return( bad (n/3 + 1) + n - 1 ); } Figure 1.2 A nonterminating recursive program The error in the following program is that Bad(1) is defined, by line 3, to be Bad(1). First two fundamental rules of recursion: 1. Base cases. You must always have some base cases, which can be solved without recursion. 2. Making progress. For the cases that are to be solved recursively, the recursive call must always be to a case that makes progress toward a base case. Printing Out Numbers Suppose we have a positive integer, n, that we wish to print out. Our routine will have the heading print_out(n). Assume that the only I/O routines available will take a single-digit number and output it to the terminal. We will call this routine print_digit; for example, print_digit(4) will output a 4 to the terminal. Printing Out Numbers Recursion provides a very clean solution to this problem. To print out 76234, we need to first print out 7623 and then print out 4. The second step is easily accomplished with the statement print_digit(n%10), but the first doesnt seem any simpler than the original problem. Indeed it is virtually the same problem, so we can solve it recursively with the statement print_out(n/10). Printing Out Numbers Indeed it is virtually the same problem, so we can solve it recursively with the statement print_out(n/10). Void PrintOut(unsigned int N) /* Print nonegative N */ { if (N = 10) PrintOut(N/10); Pr