Question

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

Answer 1

Correct choice is (a) Library sort has a better average time complexity

Best explanation: Library sort has a better average time complexity as compared to insertion sort because it uses binary search for finding the index where the element has to be inserted in the sorted array. This makes the process faster.