10 Facts About Quicksort

Quicksort is a comparison sort, meaning that it can sort items of any type for which a "less-than" relation is defined.

Efficient implementations of Quicksort are not a stable sort, meaning that the relative order of equal sort items is not preserved.

Quicksort algorithm was developed in 1959 by Tony Hoare while he was a visiting student at Moscow State University.

Quicksort wrote the partition part in Mercury Autocode but had trouble dealing with the list of unsorted segments.

Quicksort gained widespread adoption, appearing, for example, in Unix as the default library sort subroutine.

Related searches

Yaroslavskiy's Quicksort has been chosen as the new default sorting algorithm in Oracle's Java 7 runtime library after extensive empirical performance tests.

Quicksort is a type of divide and conquer algorithm for sorting an array, based on a partitioning routine; the details of this partitioning can vary somewhat, so that quicksort is really a family of closely related algorithms.

Quicksort has some disadvantages when compared to alternative sorting algorithms, like merge sort, which complicate its efficient parallelization.

Quicksort is a space-optimized version of the binary tree sort.

Quicksort competes with merge sort, another sorting algorithm.