Improving worst-case running time of insertion sort using binary search

Question

The while loop uses linear search to scan backwards. However, we know that the array within the while loop is already sorted. So we can replace the linear search with binary

Answer 1

Binary searching for the insertion point can provide a slight improvement, mainly by removing the key comparison from the loop that shifts elements up. The difference won't be significant until you are sorting a large amount of data. Of course, if you have a large dataset you should be using a better sorting algorithm...