Which of the following is not true about library sort?
Posted: Wed Jul 13, 2022 6:15 pm
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
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