Algorithms Searching, Sorting and Hashing Sorting

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

1
Merge Sort
2
Insertion Sort 
3
Selection Sort 
4
Quick Sort

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters