Which sorting algorithm has the best average-case time complexity?

Question

Accepted Answer

(C) Merge Sort. Explanation: Merge Sort and Quick Sort both have O(n log n) average case. Of the options listed, Merge Sort is O(n log n) — best among them.