快速排序（升序）

    package test;  
      
    public class QuickSort {  
        public static void main(String[] args) {  
            int[] n ={1,3,6,2,9,6,8,7};  
            quicksort(n,0,7);  
            for (int i : n) {  
                System.out.print(i+"\t");  
            }  
              
        }  
        public static void quicksort(int[] n,int left,int right){  
            int dp;  
            if(left<right){  
                dp = partition(n,left,right);  
                quicksort(n,left,dp-1);  
                quicksort(n,dp+1,right);  
            }  
        }  
        public static int partition(int[] n,int left,int right) {  
            int pivot = n[left];  
            while(left<right){  
                while(left<right&&n[right]>=pivot)  
                    right--;  
                if(left<right)  
                    n[left++]=n[right];  
                while(left<right&&n[left]<=pivot)  
                    left++;  
                if(left<right)  
                    n[right--]=n[left];  
            }  
            n[left]=pivot;  
            return left;  
      
        }  
    }