快速排序法:
public class Main {
public static void main(String[] args) {
int a[]={7,8,1,3,5};
new Main(a);
}
public Main(int[] a){
System.out.println("排序前:");
print(a);
quickSort(a,0,a.length-1);
System.out.println();
System.out.println("排序后:");
print(a);
}
public int getMiddle(int[] list,int low,int high){
int temp=list[low];//数组的第一个作为中轴
while(low<high){
while(low < high && list[high]>=temp) high--;
list[low]=list[hig