快速排序java实现

	public static void main(String[] args){
        Random random = new Random(190);
        ArrayList<Integer> ints = new ArrayList<>();
        int i = 20 ;
        while(i>0){
            ints.add(random.nextInt(200));
            i--;

        }

        class ISort{
            public ArrayList<Integer> qSort(ArrayList<Integer> ints){
                if(ints.size()<2){
                    return ints;
                }else {
                    ArrayList<Integer> integers = new ArrayList<>();
                    ArrayList<Integer> left = new ArrayList<>();
                    ArrayList<Integer> right = new ArrayList<>();
                    Integer be = ints.get(0);
                    ints.remove(0);
                    ints.forEach(
                            e->{
                                if(e<=be){
                                    left.add(e);
                                }else {
                                    right.add(e);
                                }
                            }
                    );
                    integers.addAll(qSort(left));
                    integers.add(be);
                    integers.addAll(qSort(right));
                    return integers;

                }

            }
        }

        ISort iSort = new ISort();
        ArrayList<Integer> integers = iSort.qSort(ints);
        integers.forEach(e->System.out.println(e.intValue()));
    }