The optimal time obtained through divide and conquer approach using merge sort is the best case efficiency.
(a) true
(b) false
I have been asked this question during an interview for a job.
This intriguing question originated from Computational Geometry topic in section Computational Geometry of Data Structures & Algorithms II