Quicksort tends to O(n^2) in worst case for some input at least then why not always use merge sort and never use quicksort !!
Is there any practical use case where QuickSort is must ??
Asked
Active
Viewed 56 times
1
-
1Now compare space requirements – zerkms Nov 05 '15 at 06:53
-
and take into account that allocating space in real world is a really expensive operation – MK. Nov 05 '15 at 06:55
-
2this is a duplicate http://stackoverflow.com/questions/70402/why-is-quicksort-better-than-mergesort – Marquis Blount Nov 05 '15 at 07:25
-
Beside all other concerns, the asymptotic worst-case behaviour of an algorithm is not the only criterion to judge its suitability for a specifitc purpose. – Codor Nov 05 '15 at 09:01
-
If you are sorting a lot of integers use Radix Sort O(N). – Louis Ricci Nov 05 '15 at 12:00