快速排序与归并排序 [英] Quick Sort Vs Merge Sort

问题描述

为什么快速排序比归并排序好?

Why might quick sort be better than merge sort ?

推荐答案

参见 维基百科上的 Quicksort:

通常，快速排序是显着的在实践中比其他 Θ(nlogn) 更快算法，因为它的内部循环可以在大多数情况下有效实施架构，并且在大多数现实世界中数据，可以进行设计最小化概率的选择需要二次时间.

Typically, quicksort is significantly faster in practice than other Θ(nlogn) algorithms, because its inner loop can be efficiently implemented on most architectures, and in most real-world data, it is possible to make design choices which minimize the probability of requiring quadratic time.

请注意，极低的内存要求也是一大优点.

Note that the very low memory requirement is a big plus as well.

这篇关于快速排序与归并排序的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！