What is the difference between partition sort and quick sort?
+4
A:
Quicksort is a Partitioning Sorting Algorithm, you might refer to Mergesort which also is a Partitioning Sorting Algorithm, the biggest difference is probably the speed, Quicksort is faster even though both of them are O(n*log(n)).
Quicksort uses a Pivot element for its sorting and MergeSort divides & conquers. Both however are in-place sorting algorithms, which means they don't use any extra memory when sorting.
Filip Ekberg
2009-10-13 14:45:05
+1 - Excellent AnswerWhen I saw "partition sort" I immediately thought the "he must mean a Mergesort if he's *contrasting* it to a QuickSort."
Mark Brittingham
2009-10-13 14:57:52