快速排序模板

```java
import java.util.Scanner;
public class Main{
     
    public static void sort_quick(int[] arr,int l,int r){
        if(l>=r) return ;
        int key = arr[l];
        int i = l;
        int j = r;
        while(i<j){
            while(arr[j]>=key&&i<j)j--;
            arr[i] = arr[j];
            while(arr[i]<=key && i<j)i++;
            arr[j] = arr[i];
        }
        arr[i] = key;
        sort_quick(arr,l,i-1);
        sort_quick(arr,i+1,r);
    }
    public static void main(String[] args){
      
       Scanner sc = new Scanner(System.in);
        
        int n = sc.nextInt();
       
         int[] nums =  new int[n];
        for(int i = 0;i<n;i++){
            nums[i] = sc.nextInt();
        }
        sort_quick(nums,0,n-1);
        for(int i = 0;i<n;i++){
            System.out.print(nums[i]+" ");
        }
    }
}