class QuickSort{
	public static void main(String args[]){
		int num[]={12,6,54,58,5,10};
		sort(num,0,num.length-1);
		for(int i=0;i<num.length;i++){
			System.out.print("  "+num[i]);
		}
	}
	private static void sort(int []n,int left,int right){
		if(left<right){
			int s=n[left];
			int i=left;
			int j=right+1;
			while(true){
				while(i<j && n[++i]<s);
				while(i<j && n[--j]>s);
				swap(n,i,j);
			}
			n[left]=n[j];
			n[j]=s;
			sort(n,left,j-1);
			sort(n,j+1,right);
		}
	}
	private static void swap(int []n,int i,int j){
			int t=n[i];
			n[i]=n[j];
			n[j]=t;
		}
	
}