O(nlogn)排序算法--QuickRank

O（nlogn）对应的算法是递归，我们使用递归的方法，对数组 分而治之

import java.util.ArrayList;
import java.util.List;

public class QuickRank {
    public List<Integer>quickRank(List<Integer>nums){

        List<Integer>ranked=new ArrayList<Integer>();
        int len=nums.size(),middle=len/2;

        if(len<=1)return nums;
        List<Integer>left=new ArrayList<Integer>(),right=new ArrayList<Integer>();
//  System.out.println(len+" "+middle);
        int middleNum=nums.get(middle);

        for(int i=0;i<len;i++){
            if(i!=middle){
            if (middleNum>=nums.get(i))left.add(nums.get(i));
            else right.add(nums.get(i));
                }
        }
//      System.out.print("|"+left.size()+" |");
        left=quickRank(left);
        right=quickRank(right);
        for(int l:left)ranked.add(l);
        ranked.add(middleNum);
        for(int r:right)ranked.add(r);
        return ranked;

    }

    public static void main(String[]args){
        QuickRank c=new QuickRank();
        int[]a={2,4,1,5,2,3,6,100,43};

        List<Integer>a_=new ArrayList<Integer>(),ranked=new ArrayList<Integer>();
        for(int n:a)a_.add(n);
        ranked=c.quickRank(a_);
        for(int n:ranked)System.out.print(n+" ");


    }
}