快速排序(Quick Sort)
动图演示地址(https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html)
代码结构
源码
前置条件:父接口和测试类从上篇文章获取(https://blog.csdn.net/jt781861965/article/details/117051443)
package suanfa.paixu;
public class KuaiPaiTest implements Sort {
public static void main(String[] args) {
Test.test(new KuaiPaiTest());
}
public void sort(int[] arr) {
if (arr == null || arr.length < 2) {
return;
}
process(arr, 0, arr.length - 1);
}
public void process(int[] arr, int l, int r) {
if (l >= r) {
return;
}
swap(arr, l + (int) (Math.random() * (r - l + 1)), r);
int[] ints = netherlandsFlag(arr, l, r);
process(arr, l, ints[0] - 1);
process(arr, ints[1] + 1, r);
}
public int[] netherlandsFlag(int[] arr, int l, int r) {
int min = l - 1;
int max = r - 1;
int index = l;
while (index <= max) {
if (arr[index] < arr[r]) {
swap(arr, ++min, index++);
} else if (arr[index] == arr[r]) {
index++;
} else {
swap(arr, max--, index);
}
}
swap(arr, max + 1, r);
return new int[]{min + 1, max + 1};
}
}