数据结构r5.pptVIP

Data Structure Software College Northeastern University Chapter 5 Recursion Overview Recursive Solutions Mathemetical Induction Recursive Definitions Stack Activation Frames Recursive and Iteration Recursive Solutions Recursive Function a recursion function is a function that either directly or indirectly makes a call to itself. but we need to avoid making an infinite sequence of function calls (infinite recursion) Finding a Recursive Solution a recursive solution to a problem must be written carefully the idea is for each successive recursive call to bring you one step closer to a situation in which the problem can easily be solved this easily solved situation is called the base case each recursive algorithm must have at least one base case, as well as a general (recursive) case Mathemetical Induction To prove Mathemetical Induction A recursive definition int s (int n) { if (n ==1) return 1; else return s(n-1) + n; } Printing number in Any Base const char * DIGIT_TABLE = 0123456789abcdef; const int MAX_BASE = strlen(DIGIT_TABLE); void printIntRec( int n, int base ) { if( n = base ) printIntRec( n / base, base ); cout DIGIT_TABLE[ n % base ]; } General format for Many Recursive Functions if (some easily-solved condition) // base case solution statement else // general case recursive function call Common Programming Error When a function is called... A transfer of control occurs from the calling block to the code of the function --It is necessary that there be a return to the correct place in the calling block after the function code is executed; This correct place is called the return address When any function is called, the run-time stack is used --On this stack is placed an activation record for the function call Stack Activation Frames The activation record contains the return address for this function call, and a