Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input?
a) Insertion sort
b) Quick sort
c) Merge sort
d) Selection sort
a) Insertion sort
b) Quick sort
c) Merge sort
d) Selection sort