An array A of size n is known to be sorted except for the first k elements and the last k elements, where K is a constant. Which of the following algorithms will be the best choice for sorting the array A?
A.) quick sort
B.) insertion sort
C.) selection sort
D.) bubble sort
I can’t understand how can insertion sort be better in this case?