A sorting algorithm based on a priority queue is
A) quicksort
B) insertion sort
C) bubble sort
D) heap sort

Question

Quizplus · Accepted Answer

A priority queue is a data structure which allows for efficient extraction of the minimum (or maximum) element in a collection. Heap sort is a sorting algorithm that leverages a priority queue to sort elements in O(n log n) time complexity, making it a suitable choice in this case. Quicksort and insertion sort do not use priority queues, and bubble sort is not an efficient algorithm for large collections.

A Sorting Algorithm Based on a Priority Queue Is