What is the advantage of library sort over insertion sort?
(a) Library sort has a better average time complexity
(b) Library sort has a better space complexity
(c) Library sort has better best case time complexity
(d) Library has better worst case time complexity
This question was posed to me in an online interview.
This key question is from Sorting topic in division Sorting of Data Structures & Algorithms II