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?

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.

More MCQs

Leave a Reply

Your email address will not be published. Required fields are marked *