Maurice Tutor
$15/per page/Negotiable
Use the Three-Question Method to verify the Value In List function described in this chapter.
1. Describe the Three-Question Method of verifying recursive routines in relation to an inductive proof.
2. Which data structure would you most likely see in a non-recursive implementation of a recursive algorithm?
3. Using the recursive function Rev Print as a model, write the recursive function Print List, which traverses the elements in the list in forward order. Does one of these routines constitute a better use of recursion? If so, which one?
int Puzzle(int base, int limit)
{
if (base > limit)
return -1;
else
if (base == limit)
return 1;
else
return base*Puzzle(base+1, limit);
}