1. import java.util.Arrays;
    3. /**
    4.  * @author zhangshuai
    5.  * @date 2022-06-13 13:37
    6.  */
    7. public class QuickSort {
    8.     public static void main(String[] args) {
    9.         int[] arr = {6, 1, 2, 7, 9, 3, 4, 5, 10, 8};
    10.         quickSort(arr, 0, arr.length - 1);
    11.         System.out.println(Arrays.toString(arr));
    12.     }
    14.     public static void quickSort(int[] arr,int left,int right){
    15.          if(left < right){
    16.              int pivot = partition(arr,left,right);
    17.              quickSort(arr,left,pivot-1);
    18.              quickSort(arr,pivot+1,right);
    19.          }
    20.     }
    22.     private static int partition(int[] arr,int left,int right){
    23.          int pivot = arr[right];
    24.         int i = left -1;
    25.         for(int j=left;j<right;j++){
    26.              if(arr[j]<pivot){
    27.                   i++;
    28.                  swap(arr,i,j);
    29.              }
    30.         }
    31.         swap(arr,i+1,right);
    32.         return i+1;
    33.     }
    35.     private static void swap(int[] arr,int i,int j){
    36.         int temp = arr[i];
    37.         arr[i] = arr[j];
    38.         arr[j] = temp;
    39.     }    
    40. }