ISRO | ISRO CS 2018 | Question 17

Last Updated :
Discuss
Comments

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

Share your thoughts in the comments