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

Question

Quizplus · Accepted Answer

The described algorithm is In-Place Heapsort, which involves building a heap from the unsorted array and then repeatedly removing the largest element and restoring the heap property until the heap is empty.

The Following Is the ____ Algorithm