Question
A programmer needs in-place sorting with O(n log n) worst-case time, and the chosen structure has the property that it is generally not stable. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Heap Sort
Explanation:
Heap Sort fits because it supports in-place sorting with O(n log n) worst-case time and it is generally not stable.
Both clues point to this choice.
Leave a Reply