快速排序

import java.util.Arrays;

public class quickSort {
    public static void main(String[] args) {
        int[] ary=new int[]{8,2,3,7,1,22,11,5,9,10,33};
        go(ary,0,ary.length-1);
        System.out.println(Arrays.toString(ary));
    }
    public static int getM(int[] ary,int low,int high){
        int tm=ary[low];
        while(low<high){
            while(low<high && ary[high]>=tm){
                high--;
            }
            ary[low]=ary[high];
            while(low<high && ary[low]<tm){
                low++;
            }
            ary[high]=ary[low];
        }
        ary[low]=tm;
        //System.out.println(low);
        return low;
    }
    public static void go(int[] ary,int low,int high){
        if(low<high){
            int m=getM(ary,low,high);
            go(ary,low,m-1);
            go(ary,m+1,high);
        }
    }
}
[1, 2, 3, 5, 7, 8, 9, 10, 11, 22, 33]