Which of the following is a disadvantage of library sort when compared to insertion sort?
(a) library sort has greater time complexity
(b) library sort has greater space complexity
(c) library sort makes more comparisons
(d) it has no significant disadvantage
This question was addressed to me in exam.
This intriguing question originated from Sorting in section Sorting of Data Structures & Algorithms II