title: Exactly how many comparisons does merge sort make?
body: <p>I have read that quicksort is much faster than mergesort in practice, and the reason for this is the hidden constant.</p>
  <p>Well, the solution for the randomized quick sort complexity is 2nlnn=1.39nlogn which means that the constant in quicksort is 1.39.</p>
  <p>But what about mergesort? What is the constant in mergesort?</p>