Question
A programmer needs stable sorting with guaranteed O(n log n) time, and the chosen structure has the property that its merge step usually needs auxiliary storage for arrays. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Merge Sort
Explanation:
Merge Sort fits because it supports stable sorting with guaranteed O(n log n) time and its merge step usually needs auxiliary storage for arrays.
Both clues point to this choice.
Leave a Reply