Java 分治策略实现快速排序
Thought
- Divide: Partition the array into two subarrays around a pivot x such that elements in lower subarray ≤ x ≤ elements in upper subarray.
- Conquer: Recursively sort the subarrays.
- Combine: Trivial.
以枢轴 x 为中点,每次排序将小于枢轴 x 的元素都放在 x 左边,大于 x 的元素都放在 x 右边,然后递归以同样方式对子数组排序