Data abstraction & Problem solving with C++ Exercises 1-26

SUMMARY Recursion is a technique that 2. When constructing a recursive solution solvesa poeoblem by solving a smaller problem of the ive solution, kcep the following four questions in mind: same typ b. How does each recursive call diminish the size E. What instance of the problem can How can you define the prob;em in terrns of a smaller smaller problem of the same tye problem? s, will you reach this base when construct precondition has been met. case? ing a recursive solution, you should assume that a recursive call's result is correct if ns e use the box trace to trace the actions of a recursive function. These boxes resemble which many complers use to implement recursion. Al an intuitive understanding of recursion, function. These boxes resemble activation Although the box trace is useful, it cannot recursion. replace ing of recursion, to solve problems-such as the Towers of Hanoi-whose iterative solutions are z Even the most complex problems often have straightforward recursive solu- solve 5. Recursion allows you t difficult to conceptualize. can be easier to understand, describe, and implement than iterative solutions solutions are much less efficient than a corresponding iterative solution due to their 6. Some recursive rithms and the overhead of function calls. In such cases, the iterative solution function use the recursive solution, however, to derive the iterative solution. can be preferable. You can use the recursive solcid 7. If you can easily, clearly, easily. and efficiently solve a problem by using iteration, you should do so. 7. If you EXERCISES ollowing recursive function get Number Equal searches the array x of n integers for occurrences of the redvalue. It returns the number of integers in x that are equal to desiredValue. For example contains the ten integers 1, 2, 4, 4,5,6,7, 8, 9, and 12, then get NumberEqual (x, 10, 4) returns the value 2, because 4 occurs twice in x. int getNumberEqual (const int x[l. int n, int desiredValue) int count = 0; if (n