快速排序(java)

import java.util.Scanner;
public class Test{
    public static void main(String[] args) {
        Scanner inp=new Scanner(System.in);
        int n=inp.nextInt();
        int a[]=new int[n];
        for(int i=0;i<n;i++)a[i]=inp.nextInt();
        s(a,0,n-1);
        for(int i=0;i<n;i++)System.out.print(a[i]+" ");
    }
    public static void s(int a[],int left,int right){
        int key;
        if(left<right){
            key=move(a,left,right);
            s(a, left, key-1);
            s(a, key+1, right);
        }
    }
    public static int move(int a[],int left,int right){
        int v=a[left];
        while(left<right){
            while(left<right&&v<=a[right])right--;
            a[left]=a[right];
            while(left<right&&v>=a[left])left++;
            a[right]=a[left];
        }
        a[left]=v;
        return left;
    }
}