Independent sorting
Computer Science
Level
pending
Which of the following sorting algorithm has a running time that is least dependent on the initial ordering of the inputs?
Selection sort
Bubble sort
Insertion sort
Merge sort
Quick sort
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Merge sort has the same time for all n inputs.