Multiple Choice
Suppose you wanted to test your sort on an array filled with different elements each time the code is run. What is an efficient technique for creating an array of 1,000 elements for each run?
A) Run the program many times, entering different values for the array elements.
B) Make a file with many sets of values and loop through them, sorting each one.
C) Use the Random class to generate array elements, sorting each set in a loop.
D) Create many different arrays with different elements in the program code and sort each array.
Correct Answer:
Verified
Correct Answer:
Verified
Q98: If a call to the Arrays static
Q99: The method findLargest examines the elements of
Q100: A search technique where, in each step,
Q101: Find the simplest order of growth of
Q102: The partial binary search method below is
Q104: The method checkArray examines an array arr:
Q105: If you want to use the Comparable
Q106: How large does n need to be
Q107: The merge sort algorithm presented in section
Q108: When the size of an array increases