A community for students.
Here's the question you clicked on:
 0 viewing
 2 years ago
which is faster/better
heapsort or quicksort or merge sort
{ example :to order a million random numbers}
 2 years ago
which is faster/better heapsort or quicksort or merge sort { example :to order a million random numbers}

This Question is Closed

rsmith6559
 2 years ago
Best ResponseYou've already chosen the best response.1For 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.

KonradZuse
 2 years ago
Best ResponseYou've already chosen the best response.0It's all about the Shell Sort baby!

krithika
 2 years ago
Best ResponseYou've already chosen the best response.0As others have noted, worst case of Quicksort is O(n^2), while mergesort and heapsort stay at O(nlogn). On the average case, however, all three are O(nlogn); so they're for the vast majority of cases comparable. What makes Quicksort better on average is that the inner loop implies comparing several values with a single one, while on the other two both terms are different for each comparison. In other words, Quicksort does half as many reads as the other two algorithms. On modern CPUs performance is heavily dominated by access times, so in the end Quicksort ends up being a great first choice.
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.