第一种实现方式采用《算法导论》(原书第3版)中的快速排序算法,且参考了《剑指Offer》(第2版)中递归实现快速排序的代码,如下:
public void quickSort_1(int[] data, int start, int end) {
if (data == null || start < 0 || end > data.length - 1) {
throw new IllegalArgumentException("Invalid Parameters");
}
if (start == end) return;
int index = partition(data, start, end);
if (index > start) {
quickSort_1(data, start, index - 1);
}
if (index < end) {
quickSort_1(data, index + 1, end);
}
}
private int partition(int[] data, int start, int end) {
int index = start + (int)(Math.random() * (end - start + 1));
swap(data, index, end);
int small = start - 1;
for (index = start; index < end; index++) {
if (data[index] < data[end]) {
small++;
if (small != index) {
swap(data, index, small);
}
}
}
swap(data, small + 1, end);
return small + 1;
}
private void swap(int[] data, int i, int j){
int temp = data[i];
data[i] = data[j];
data[j] = temp;
}
第二种实现方式是快排经典的“挖坑填数+分治”,如下:
public void quickSort_2(int[] data, int start, int end) {
if (data == null || start >= end) return;
int i = start, j = end;
int pivotKey = data[start];
while (i < j) {
while (i < j && data[j] >= pivotKey) j--;
if (i < j) data[i++] = data[j];
while (i < j && data[i] <= pivotKey) i++;
if (i < j) data[j--] = data[i];
}
data[i] = pivotKey;
quickSort_2(data, start, i - 1);
quickSort_2(data, i + 1, end);
}
---------------------
作者:Aprial2018
来源:CSDN
原文:https://blog.csdn.net/liuzhenya1994/article/details/80254958
版权声明:本文为博主原创文章,转载请附上博文链接!