Of the following sorting algorithms, which has a running time thatis least dependent on the initial ordering of the input?

A

Merge Sort

B

Insertion Sort

C

Selection Sort

D

Quick Sort