What is the average case time complexity of standard merge sort?
(a) O(n log n)
(c) O(n^2 log n)
(d) O(n log n^2)
This question was addressed to me during an interview for a job.
My question comes from Sorting topic in division Sorting of Data Structures & Algorithms II