Unlike the while and for loops, the do loop is considered to be in what category of loops?

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; else index++; } if(found==true) return index; else return -1; } a. Add another parameter to indicate where to stop searching b. Add another parameter to indicate where to start searching c. This already can find all occurrences of a given target d. Have the function return the whole array

The Quick Sort algorithm was developed in 1960 by

A) Bjarne Stroustrup. B) Tony Gaddis. C) C.A.R. Hoare. D) Judy Walters. E) None of the above