Given the following function definition, what modifications need to be made to the search function so that it finds all occurrences of target in the array? int search (const int array[], int target, int numElements) {int index=0; bool found=false; while ((! found) && (index < numElements)) {if (array[index] = = target) found=true; elseindex++; }if (found==true) return index; elsereturn - 1; }a. Add another parameter to indicate where to stop searchingb. Add another parameter to indicate where to start searchingc. This already can find all occurrences of a given targetd. Have the function return the whole array

Question

Mallory Hernandez

Computers & Technology

6 March, 20:36

Given the following function definition, what modifications need to be made to the search function so that it finds all occurrences of target in the array? int search (const int array[], int target, int numElements) {int index=0; bool found=false; while ((! found) && (index < numElements)) {if (array[index] = = target) found=true; elseindex++; }if (found==true) return index; elsereturn - 1; }a. Add another parameter to indicate where to stop searchingb. Add another parameter to indicate where to start searchingc. This already can find all occurrences of a given targetd. Have the function return the whole array

+5

Answers (1)

Know the Answer?

Muscles · Answer 1

D. have function return the whole array

Explanation:

the given function only return first occurrence of target. In order to get all occurrences of target we have to change condition in while loop to check whole array even if first occurrence of target found and plus add another parameter of type array that will store different indexes of occurrence of target and return that array