java代码实现:
// 快速排序的切分 每次都以当前表第一个元素作为基准值
public static int partition(int[] a, int low, int high) {
// 将数组切分为a[low..i-1],a[i],,a[i+1..high]
int pivot = a[low];// 将当前表中第一个元素设为基准值
while (low < high) {
while (low < high && a[high] >= pivot)//从最右边开始搜索比pivot小的
--high;
a[low] = a[high];
while (low < high && a[low] <= pivot)//从最左边搜索比pivot大的
++low;
a[high] = a[low];
}
a[low] = pivot;
return low;
}
public static void Quick(int a[], int low, int high) {
if (low < high) {
// j就是划分操作,将表划分为两个子表
int j = partition(a, low, high);
Quick(a, low, j - 1); // 将左半部分a[low...j-1] 排序
Quick(a, j + 1, high);// 将右半部分a[j+1...high]排序
}
}
public static void main(String[] args) {
int[] a = new int[]{6, 4, 3, 1, 8, 9, 5, 7, 2, 10};
quick(a,0,a.length-1);
for (int i : a) {
System.out.print(i+" ");
}
}