区分归并排序（Merge Sort）与快速排序（Quick Sort）。

In sorting algorithms, distinguish between merge sort and quick sort.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: medium

标签: Merge Sort, Quick Sort

参考答案摘要

参考答案 Quick sort partitions the array (not necessarily equal halves), is in-place and typically fast due to cache locality, but has worst-case O(n^2) and is not stable by default. Merge sort splits int...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。