Of the following sorting algorithms, which has a running time that is least dependent on the initial ordering of the input?
Merge Sort
Insertion Sort
Selection Sort
Quick Sort
This question is part of this quiz :