Multiple Choice
The following represents the ____ sort algorithm.
Set the initial value of gap to n / 2.
While gap > 0
For each array element from position gap to the last element
Insert this element where it belongs in its subarray.
If gap is 2, set it to 1.
Else gap = gap/2.2.
A) Shell
B) Heap
C) Insertion
D) Quick
Correct Answer:
Verified
Correct Answer:
Verified
Q1: A class that implements the Comparable interface
Q2: You can think of the _ sort
Q3: Insertion sort is considered a quadratic sort.
Q5: Which of the following generally gives the
Q6: Which of the following sorts is not
Q7: _ sorts an array by making several
Q8: Whenever a recursive method is called, a
Q9: _ sort has O(n<sup>3/2</sup>) or better performance.
Q10: The idea behind _ sort is to
Q11: In the best case, selection sort makes