Which of the following soring 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