title: Quicksort vs. In-place Merge Sort
body: <p>I was researching whether or not Quicksort is better than Merge Sort, and most sources were in consensus that Quicksort is better, because it is in-place, while Merge Sort is not. However, there exist in-place Merge Sort algorithms, which invalidate the "it needs extra space" argument. So which is better, Quicksort or In-place Merge Sort?</p>
  
  <p>PS: When I say better, I mean faster, since space is not an issue for either of these sorts.</p>
  
  <p>EDIT: Is any speed lost when switching from out-of-place Merge Sort to in-place Merge Sort?</p>