What will be the best case time complexity of merge sort?
(a) O(n log n)
(c) O(n^2 log n)
(d) O(n log n^2)
I had been asked this question during an internship interview.
The doubt is from Sorting in portion Sorting of Data Structures & Algorithms II