Quicksort slower than Mergesort?

Question

I was working on implementing a quicksort yesterday, and then I ran it, expecting a faster runtime than the Mergesort (which I had also implemented). I ran the two, and while th

Answer 1

Were you datasets random enough? Were they partially sorted?

That might affect the speed of the sort...

Like for the QuickSort's partition(), you'd skip along if the numbers are in sorted order, until you find one that's not.