which is faster/better- heapsort or quicksort or merge sort { example :to order a million random numbers}

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

For randomly ordered data, quicksort is the fastest. Quicksort's achilles heel is nearly sorted data, it becomes slow. Merge sort is slower than quicksort on random data, but doesn't deteriorate on nearly sorted data. Check out wikipedia, they have some great info on sorting.

but how abt heapsort?

It's all about the Shell Sort baby!

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.