快速排序

package com.org.csu;

public class QuickSortDemo {
    public static void main(String[] args){
        int [] arr={123,12,456,56,21,789};

        quickSort(arr,0,5);
        for (int i : arr) {
            System.out.println(i);
        }
    }
    private static void quickSort(int[]arr,int low,int high){

        if(low<high){
            int index=getIndex(arr,low,high);
            quickSort(arr,0,index-1);
            quickSort(arr,index+1,high);
        }
    }
    private static int getIndex(int []arr,int low,int high){
        int temp=arr[low];
        while(low<high){
            while(arr[high]>=temp&&low<high){
                high--;
            }
            arr[low]=arr[high];
            while(low<high&&arr[low]<=temp){
                low++;
            }
            arr[high]=arr[low];

        }
        arr[low]=temp;
        return low;
    }

}