快速排序

//package test;

public class Main {

	public static void main(String[] args) {
		int[] nums = { 7, 3, 4, 6, 2, 6, 4, 67, 4 };
		quick(nums,0,nums.length-1);
		for (int a : nums) {
			System.out.print(a + " ");
		}
	}
	public static int partition(int[] nums,int q,int r){
		int x=nums[r];
		int i=q-1;
		int temp=0;
		for(int j=q;j<r-1;j++){
			if(nums[j]<x){
				i++;
				temp=nums[i];
				nums[i]=nums[j];
				nums[j]=temp;
			}
		}
		temp=nums[i+1];
		nums[i+1]=nums[r];
		nums[r]=temp;
		return i+1;
	}
	public static void sort(int[] nums,int p,int r){
		if(p<r){
			int q=partition(nums,p,r);
			sort(nums,p,q-1);
			sort(nums,q+1, r);
		}
	}
	public static void quick(int[] nums,int p,int r){
		if(nums.length>0){
			sort(nums,p,r);
		}
	}
}