What is the difference between partition sort and quick sort?

quicksort, sorting

Solution

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.

Problem

Original source