Quick Sort Vs Merge Sort

algorithm, sorting

Solution

See Quicksort on wikipedia:

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.

Problem

Original source

Related problems

• Is Quicksort a potential security risk?
• Stable, efficient sort?
• Which is more expensive operation swap or comparison in integer array in Java
• Why is quicksort better than mergesort?