快速排序

package test;
import java.util.*;

class sort{
    void qsort(int a[],int left,int right){
        if(left>right)
            return;
        int i=left;
        int j=right;
        int key=a[i];
        while(i<j){
            while(i<j&&a[j]>=key)
                j--;
            a[i]=a[j];
            while(i<j&&a[i]<=key)
                i++;
            a[j]=a[i];
        }
        a[i]=key;
        qsort(a,left,i-1);
        qsort(a,j+1,right);
    }
}
public class Main {
    public static void main(String args[]){
        int b[]=new int[10];
        Scanner cin=new Scanner(System.in);
        for(int i=0;i<10;i++)
            b[i]=cin.nextInt();
        cin.close();
        sort p=new sort();
        p.qsort(b, 0, 9);
        for(int i=0;i<10;i++)
            System.out.println(b[i]);
    }
}