Question
Which data structure or concept is best described as a comparison sort that repeatedly removes an extreme element from a heap?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Heap Sort
Explanation:
Heap Sort is a comparison sort that repeatedly removes an extreme element from a heap.
This description distinguishes it from the other choices.
Leave a Reply