快速排序

public class test {    public static void main(String []args){        int data[]={2,41,45,6,3,33,4324,23,4,324,432,4,32,4,23,4,32,4,32,4,32,4,32,4,23,4,32,4,23,4,32,4,3};        QuickSort(data,0,data.length-1);        for (int i = 0;i<data.length;i++){            System.out.print(data[i]+" ");        }        System.out.println();    }//end main   static   void  QuickSort(int []val,int start,int end){        //结束标志        if(start>=end){            return;        }        int cnt=start;        int tempval;        for(int i = start+1;i<=end;i++){            if(val[i]<val[start]){                cnt++;                System.out.println("换。。。i:"+i+" cnt:"+cnt+" valp[i]"+val[i]+" val[cnt]:"+val[cnt]);                 tempval=val[i];                val[i]=val[cnt];                val[cnt]=tempval;            }        }        tempval=val[start];        val[start]=val[cnt];        val[cnt]=tempval;       System.out.print("start:"+start+" end:"+end+" cnt:"+cnt+" ");       for (int i = 0;i<val.length;i++){           System.out.print(val[i]+" ");       }       System.out.println();        QuickSort(val,start,cnt-1);        QuickSort(val,cnt+1,end);    }//end QuickSort}