快排算法-java

public class QuickSort {



    private static void quickSort(int[] arr, int _left, int _right) {
        int left = _left;
        int right = _right;

        int temp;

        if (left <= right) {
            temp = arr[left];
            while (left != right) {
                while (right > left && arr[right] >= temp) {
                    right--;
                }
                arr[left] = arr[right];
                while (left < right && arr[left] <= temp) {
                    left++;
                }
                arr[right] = arr[left];
            }
            arr[right] = temp;
            quickSort(arr, _left, left-1);
            quickSort(arr,right+1,_right);
        }
    }
    public static void main(String[] args){
        int array[] = {5,10,3,1,7,2,8};
        System.out.println("排序之前：");
        for(int element : array){
            System.out.print(element+" ");
        }

        quickSort(array,0,array.length-1);

        System.out.println("\n排序之后：");
        for(int element : array){
            System.out.print(element+" ");
        }
    }
}