快速排序算法

代码经过验证，可参考。。。

package test;
import java.util.Random;

public class No5Kuaisu {
public static void quickSort(int[] array) {
quickSort(array, 0, array.length - 1);
}

private static void quickSort(int[] array, int low, int high) {
if (low < high) {
int p = partition(array, low, high);
quickSort(array, low, p - 1);
quickSort(array, p + 1, high);
}
}

private static int partition(int[] array, int low, int high) {
int s = array[high];
int i = low - 1;
for (int j = low; j < high; j++) {
if (array[j] < s) {
i++;
swap(array, i, j);
}
}
swap(array, ++i, high);
return i;
}

private static void swap(int[] array, int i, int j) {
int temp;
temp = array[i];
array[i] = array[j];
array[j] = temp;
}

public static void main(String[] args) {
Random rd = new Random();
int[] src = new int[10];
for (int i = 0; i < 10; i++) {
src[i] = rd.nextInt(100);
}
for (int i : src)
System.out.println(i);
System.out.println("----------------------------------");
quickSort(src);
for (int i : src)
System.out.println(i);
System.out.println("----------------------------------");
}
}