Multiple Choice
The following is the ____ algorithm.
Build a heap by rearranging the elements in an unsorted array.
While the heap is not empty
Remove the first item from the heap by swapping it with the last item in the heap
And restoring the heap property.
A) Quicksort
B) Bubble sort
C) Merge sort
D) In-Place Heapsort
Correct Answer:
Verified
Correct Answer:
Verified
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
Q13: The following represents the algorithm for _
Q14: With respect to merge sort, additional space
Q15: The following is the _ algorithm.<br>Access the
Q16: The following is the _ algorithm<br>For fill
Q17: Shell sort is _ if successive powers