Not quite
Computer Science
Level
3
Which of the following has the
best
best case running time?
Merge sort
Heap sort
Bogosort
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
Best case for bogosort is that from the first shuffle array will be sorted. And for other methods we have O(n log n).