参考文章:十大经典排序
参考:各种排序
//快排方法,例如数组data[],排序方法:fastSort(data, 0, data.length - 1);
public static void fastSort(int arr[], int low, int high) {
int l = low;
int h = high;
int povit = arr[low];
while (l < h) {
while (l < h && arr[h] >= povit) {
h--;
}
while (l < h && arr[l] <= povit) {
l++;
}
if (l < h) {
int temp = arr[h];
arr[h] = arr[l];
arr[l] = temp;
}
}
int temp = arr[low];
arr[low] = arr[l];
arr[l] = temp;
if (l > low) {
fastSort(arr, low, l - 1);
}
if (h < high) {
fastSort(arr, l + 1, high);
}
}