Which of the following is not true about library sort?
(a) it uses binary search and insertion sort in its implementation
(b) gaps are created between successive elements in order to ensure faster insertion
(c) array needs to be re balanced after every insertion
(d) it is an in place sorting algorithm
I have been asked this question by my college professor while I was bunking the class.
Query is from Sorting in portion Sorting of Data Structures & Algorithms II