C 언어에서 빠른 정렬을 사용하여 정렬하는 방법

public class QuickSort {
 
   public static void quickSort(int [] arr,int left,int right) {
      int pivot=0;
      if(left<right) {
         pivot=partition(arr,left,right);
         quickSort(arr,left,pivot-1);
         quickSort(arr,pivot+1,right);
      }
   }
 
   private static int partition(int[] arr,int left,int right) {
      int key=arr[left];
      while(left<right) {
         while(left<right && arr[right]>=key) {
            right--;
         }
         arr[left]=arr[right];
         while(left<right && arr[left]<=key) {
            left++;
         }
         arr[right]=arr[left];
      }
      arr[left]=key;
      return left;
   }
  
   public static void main(String[] args) {
      int arr[]= {65,58,95,10,57,62,13,106,78,23,85};
      System.out.println("排序前："+Arrays.toString(arr));
      quickSort(arr,0,arr.length-1);
      System.out.println("排序后："+Arrays.toString(arr));
   }
}

排序前：[65, 58, 95, 10, 57, 62, 13, 106, 78, 23, 85]
排序后：[10, 13, 23, 57, 58, 62, 65, 78, 85, 95, 106]