SHARE
SPREAD
HELP

The Tradition of Sharing

Help your friends and juniors by posting answers to the questions that you know. Also post questions that are not available.


To start with, Sr2Jr’s first step is to reduce the expenses related to education. To achieve this goal Sr2Jr organized the textbook’s question and answers. Sr2Jr is community based and need your support to fill the question and answers. The question and answers posted will be available free of cost to all.

 

#
Authors:
Walter Savitch ,julia Lobur
Chapter:
Arrays
Exercise:
Self-test Exercises
Question:19 | ISBN:9780321531346 | Edition: 7

Question

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.

TextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbook

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'.