快速排序是由东尼·霍尔所发展的一种排序算法。在平均状况下，排序 n 个项目要Ο(n log n)次比较。在最坏状况下则需要Ο(n2)次比较，但这种状况并不常见。事实上，快速排序通常明显比其他Ο(n log n) 算法更快，因为它的内部循环（inner loop）可以在大部分的架构上很有效率地被实现出来。-Quicksort is developed by the East Ni Huoer a sorting algorithm. In the average case, sort n items to Ο (n log n) comparisons. In the worst case requires Ο (n2) comparisons, but this situation is not common. In fact, often significantly higher than the other quick sort Ο (n log n) algorithm is faster because its internal loop (inner loop) may be in most architectures it be implemented very efficiently.