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