java快速排序

package com.sxt.aboutNiuKe;

import java.util.*;

public class Main{
    public static void main(String args[]) {
        int[] arr={5,1,2,3,4,6,3,4,8,7,9};
        quickSort(arr,0,10);
        System.out.println(Arrays.toString(arr));
    }

    public static void quickSort(int[] arr,int left,int righ){
        if (left>=righ||left<0||righ>arr.length-1){
            return;
        }
        int i=left,j=righ,temp=arr[left];
        while(i=temp&&i!=j){
                j--;
            }
            while (arr[i]<=temp&&i!=j){
                i++;
            }
            if (i 
输出：
 
[1, 2, 3, 3, 4, 4, 5, 6, 7, 8, 9]