快速排序

代码主体：

public  class QuickSort {
    public static void Sort(int[] List,int left,int right){
        
        if (left<right){
            int i=cf(List,left,right);
            Sort(List,left,i-1);
            Sort(List,i+1,right);
        }        
    }
    
    public static int cf(int[] List,int left,int right){
        int Temp=List[left];
        while(left<right){
            while(left<right && List[right]>=Temp){
                right=right-1;
            }        
            List[left]=List[right];
            
            while(left<right && List[left]<=Temp){
                left=left+1;
            }
            List[right]=List[left];
        }
        List[left]=Temp;
        return left;
    }

}

客户端调用：

public static void main(String[] arg){
        int[] arr=new int[]{8,11,2,3,22,88,7,99};
        QuickSort.Sort(arr, 0, arr.length-1);
        for(int x:arr){
            System.out.print(x +",");
        }
    
    }

运行结果：

2,3,7,8,11,22,88,99,