快速排序

阅读更多
public class QuickS {
    public static void main(String[] args) {
        int arr[]={9,5,58,24,3,15,6,55,7,56,45,2};
        sort(arr,0,arr.length-1);
        StringBuilder sb=new StringBuilder();
        for (int i = 0; i < arr.length; i++) {
            sb.append(arr[i]);
            sb.append(",");
        }
        System.out.println(sb.toString());
    }
    public static void sort(int [] array,int low,int high){
        int l=low;
        int h=high;
        int mark=array[l];
        System.out.println("l="+l+",       h="+h+"          mark="+mark);
        while (l mark) h--;
            if(llow)sort(array,low,l-1);
        if(h 

你可能感兴趣的:(快速排序算法)