Java快排代码

 快速排序

public class MySort {
    public static void main(String[] args) {
        int[] arr = {3,4,1,9,5,6,8,7,2};
        sore(arr,0,arr.length-1);
        System.out.println("Arrays.toString(arr) = " + Arrays.toString(arr));
    }
    
    public static void sore(int[] arr,int front,int end){
        //终点
        if (front > end){
            return;
        }
        int i = front;
        int j = end;
        int sign = arr[front];

        while (i < j){
            while (i < j && arr[j] >= sign){
                j--;
            }
            while (i < j && arr[i] <= sign){
                i++;
            }
            int temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
        }

        int temp = arr[i];
            arr[i] = arr[front];
            arr[front] = temp;

            //递归
        sore(arr,front,j-1);
        sore(arr,j+1,end);
    }
}