2019-05-23快排

package 排序算法;

import java.util.Arrays;

public class QuickSort {
    public static void main(String[] args) {
        int[] a= {1,32,5,3,2,74,23};
        quickSort(a, 0, a.length-1);
        System.out.println(Arrays.toString(a));
    }
    public static void quickSort(int[] arr, int L, int R) {
        if(Lnum){
                swap(arr, --more, L);
            }
        }
        return new int[]{less, more};
    }
    public static void swap(int[] arr, int a, int b) {
        int temp=arr[a];
            arr[a]=arr[b];
            arr[b]=temp;
    }
}