< previous page page_a78 next page >

Page A78
3e26ecb1b6ac508ae10a0e39d2fb98b2.gif
to
3e26ecb1b6ac508ae10a0e39d2fb98b2.gif
cout << head->component << endl;
RevPrint(head->link);                             // Recursive call
3e26ecb1b6ac508ae10a0e39d2fb98b2.gif
and reword the function postcondition accordingly.
Chapter 19
Case Study Follow-Up
2. 0, the index of the first array element. The recursive algorithm starts at the fifth element but recursively calls itself until it reaches the first element, which is stored into minSoFar; then it compares minSoFar to the second element, and so on.

 
< previous page page_a78 next page >