/**
* @Date: 2020-03-24
* @Description: 快速排序算法(选取一个数为基数 , 比他大的总是在右边 , 小的总是在左边)
* @Description: 时间复杂度好的情况下为O(n), 坏的情况下为O(n ^ 2)
*/
public static void quickSort(int a[], int low, int high) {
if (low >= high) {
return;
}
int p = partition(a, low, high);
quickSort(a, low, p - 1);
quickSort(a, p + 1, high);
}
public static int partition(int[] a, int low, int high) {
int i = low;
int j = high;
int base = a[low];
while (i != j) {
while (a[j] >= base && i < j) {
j--;
}
while (a[i] <= base && i < j) {
i++;
}
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}
//将a[low] a[i]的值进行交换,因为a[i]始终是比base小的数的最右边的一个数
a[low] = a[i];
a[i] = base;
return i;
}