Following is the declaration for an alternative version of the function
search defined in Display 7.12. In order to use this alternative version of
the search function we would need to rewrite the program slightly, but
for this exercise all you need to do is to write the function definition for
this alternative version of search.
bool search(const int a[], int number_used,
int target, int& where);
//Precondition: number_used is <= the declared size of the
//array a; a[0] through a[number_used -1] have values.
//Postcondition: If target is one of the elements a[0]
//through a[number_used - 1], then this function returns
//true and sets the value of where so that a[where] ==
//target; otherwise this function returns false and the
//value of where is unchanged.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.