2017-01-22 Merge Sort and Quick Sort Merge Sort Quick Sort Cracking The Coding Interview Merge Sort Runtime: 0(n Log(n)) average and worst case. Quick Sort Runtime: 0(n Log(n)) average,0(n2) worst case.