快排10个数
public class QuickSortTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] arr = {1,9,3,12,7,8,3,4,65,22};
quickSort(arr, 0, arr.length-1);
for(int i:arr){
System.out.print(i+",");
}
}
public static int partition(int []array,int low,int high){
int key = array[low];// 选定基准点
while(low<high){
// 从后往前推
while(array[high]>=key && high>low){
high--;
}
//array[low] = array[high];
swap(array,low,high);
// 从前往后推
while(array[low]<=key && high>low){
low++;
}
//array[high] = array[low];
swap(array,high,low);
}
array[high] = key;
return high;
}
public static void swap(int[] a, int x, int y) {
int temp = a[x];
a[x] = a[y];
a[y] = temp;
}
public static void quickSort(int[] array,int lo ,int hi){
if(lo>=hi){
return ;
}
//进行第一轮排序获取分割点
int index=partition(array,lo,hi);
//排序前半部分
quickSort(array, lo, index - 1);
//排序后半部分
quickSort(array,index+1,hi);
}
}