This comparison is completely about constant factors. In particular, the choice is between a suboptimal choice of the pivot for Quicksort versus the copy of the entire input for Mergesort (or the complexity of the algorithm needed to avoid this copying). It turns out that the Quicksort is more efficient: there's no theory behind this, it just happens to be faster. (Referred from Quora)