快速排序java简单实现

 Java代码实现简单的快速排序

public class QuickSort {
    public static void quickSort(int[] arr,int low,int high){
        int i,j,temp,t;
        if(low>high){
            return;
        }
        i=low;
        j=high;
        //temp就是基准位
        temp = arr[low];
        while(i<j){
        	//倒序
        	/*while(arr[j]<=temp&&i<j){
        		j--;
        	}
        	while(arr[i]>=temp&&i<j){
        		i++;
        	}*/
        	//顺序
        	while(temp<=arr[j]&&i<j){
        		j--;
        	}
        	while(temp>=arr[i]&&i<j){
        		i++;
        	}
        	if(i<j){
        		t = arr[j];
        		arr[j]=arr[i];
        		arr[i]=t;
        	}
        }
        arr[low]=arr[i];
        arr[i]=temp;
        quickSort(arr, low, i-1);
        quickSort(arr, i+1, arr.length-1);
    }

    public static void main(String[] args){
        int[] arr = {10,7,2,4,7,62,3,4,90,1,8,9,19};
        quickSort(arr, 0, arr.length-1);
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i]);
        }
        
    }
}