Chapter 19 Java
Which of the following statements is true?
Which of the following statements is true?
How much faster is insertion sort with a 15-element array than with a 60-element array?
19 times.
Using a binary search, what is the maximum number of comparisons required to find a search key in a 31-element sorted array?
5.
Which of the following is a way to sort data?
All of the above.
What does each iteration of the insertion sort algorithm do?
Each iteration takes the next element in the unsorted portion of the array and inserts it into the sorted portion.
How many comparisons will the linear search algorithm make if the search key is not in an array of 10 elements?
How many comparisons will the linear search algorithm make if the search key is not in an array of 10 elements?
the run time and the memory use
Merge sort.
Which of the following is a negative of binary search?
The data must be in sorted order.
What is the term used for binary search's run time?
What is the term used for binary search's run time?
Different sorting algorithms on a particular array produce the same result; the choice of algorithm affects ________ of the program that implements the algorithm.
the run time and the memory use
