 Although heapsort has the same time bounds as merge sort, it requires only Θ(1) auxiliary space instead of merge sort's Θ("n").On typical modern architectures, efficient quicksort implementations generally outperform mergesort for sorting RAM-based arrays.On the other hand, merge sort is a stable sort and is more efficient at handling slow-to-access sequential media.