快速排序(QuickSort)是一种有效的排序算法。虽然算法在最坏的情况下运行时间为O(n^2)，但由于平均运行时间为O(nlogn)，并且在内存使用、程序实现复杂性上表现优秀，尤其是对快速排序算法进行随机化的可能，使得快速排序在一般情况下是最实用的排序方法之一。快速排序被认为是当前最优秀的内部排序方法。-Quick Sort (QuickSort) is an efficient sorting algorithms. Although the algorithm runs in the worst case time is O (n ^ 2), but because the average running time of O (nlogn), and memory usage, procedures to achieve good performance on complex, especially for fast sorting algorithm randomly of the possibility of making quick sort in general is one of the most practical sorting method. Quicksort is currently considered the best internal sorting methods.