Heapsort has a worst case complexity of O(nlogn) while Quicksort is O(n^2). But empirical evidence says Quicksort is superior. Why is that?
-
-
Answer:
This link provides a really good explanation for your question. https://www.cs.auckland.ac.nz/software/AlgAnim/qsort3.html
Narendra Rajput at Quora Visit the source
Other answers
Avg case complexity is better in case of quicksort. Moreover, you can take simple steps to minimize the risk of landing into the worst case, by choosing appropriate pivot.
Priyanshu Singh
Related Q & A:
- How to get all intersections between two simple polygons in O(n+k?Best solution by Computational Science
- When does J.O.N.A.S come out?Best solution by Yahoo! Answers
- How to clean a silicone case?Best solution by youtube.com
- How much does a crave case at White Castle cost?Best solution by kgbanswers.com
- Where can I find a waterproof case?Best solution by Amazon Askville
Just Added Q & A:
- How many active mobile subscribers are there in China?Best solution by Quora
- How to find the right vacation?Best solution by bookit.com
- How To Make Your Own Primer?Best solution by thekrazycouponlady.com
- How do you get the domain & range?Best solution by ChaCha
- How do you open pop up blockers?Best solution by Yahoo! Answers
For every problem there is a solution! Proved by Solucija.
-
Got an issue and looking for advice?
-
Ask Solucija to search every corner of the Web for help.
-
Get workable solutions and helpful tips in a moment.
Just ask Solucija about an issue you face and immediately get a list of ready solutions, answers and tips from other Internet users. We always provide the most suitable and complete answer to your question at the top, along with a few good alternatives below.