https://zheng-bobo.github.io/en/categories/algorithms/ Recent content in Algorithms on Blowing in the wind Hugo -- gohugo.io en Wed, 13 Nov 2019 20:32:10 +0800 https://zheng-bobo.github.io/en/post/why-quicksort-is-used-more-than-merge-sort/ Wed, 13 Nov 2019 20:32:10 +0800 https://zheng-bobo.github.io/en/post/why-quicksort-is-used-more-than-merge-sort/ What is honey to you is arsenic to another. Quick sort: 1 2 3 * Worst-case time complexity: O(n^2) * Best-case time complexity: O(n log n) * Average time complexity: O(n log n) Merge sort: 1 * Worst-, best-, and average-case time complexity: O(n log n) Since the time complexity of merge sort is >= the time complexity of quick sort in different situations, why are the sorting algorithms we use in actual programming quick sort instead of merge sort?