快速排序是一种高效且通用的分治排序算法。 Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959[1] and published in 1961.[2] It is still a commonly used algorithm for sorting. Overall, it is slightly faster than merge sort and heapsort for randomized data, particularly on larger distributions.[3] Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. For this reason, it is sometimes called partition-exchange sort.[4] The sub-arrays are then sorted recursively. This can be done in-place, requiring small additional amounts of memory to perform the sorting. Quicksort is a comparison sort, meaning that it can sort items of any type for which a "less-than" relation (formally, a total order) is defined. Most implementations of quicksort are not stable, meaning that the relative order of equal sort items is not preserved. 【快速排序是一种高效的通用排序算法。 快速排序由英国计算机科学家 Tony Hoare 于 1959 年开发，并于 1961 年发表。它仍然是一种常用的排序算法。 总的来说，对于随机数据，它比合并排序和堆排序稍快，特别是在较大的分布上。 快速排序是一种分而治之的算法。 它的工作原理是从数组中选择一个“枢轴”元素，并根据其他元素是小于还是大于枢轴将其他元素划分为两个子数组。 因此，有时称为分区交换排序。然后对子数组进行递归排序。 这可以就地完成，需要少量的额外内存来执行排序。 快速排序是一种比较排序，这意味着它可以对定义了“小于”关系（正式称为全序）的任何类型的项目进行排序。 大多数快速排序的实现都不稳定，这意味着相同排序项的相对顺序不会保留。】