QuickSort&HeapSort

public class Sort{
    public static void QuickSort(int[] arr, int start, int end){
        if(null==arr||end-start<=1)return;
        int part = partion(arr,start,end);
        QuickSort(arr,start,part-1);
        QuickSort(arr,part+1,end);
    }
    public static int partion(int[] arr, int start, int end){
        int value = arr[start];
        while(start<end){
            while(start<end&&arr[end]>value) end--;
            exchangeElements(arr,end,start);
            while(start<end&&arr[start]<=value)start++;
            exchangeElements(arr,end,start);
            }
            //arr[start] = value;
        return start;
    }
    public static void printArray(int[] array) {
        System.out.print("{");
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i]);
            if (i < array.length - 1) {
                System.out.print(", ");
            }
        }
        System.out.println("}");
    }

public static void exchangeElements(int[] array, int index1, int index2) {
    int temp = array[index1];
    array[index1] = array[index2];
    array[index2] = temp;
}
public static void maxHeap(int[] array, int heapSize,int index){
    int left = index * 2 + 1;
    int right = index * 2 + 2;

    int largest = index;
    if (left < heapSize && array[left] > array[index]) {
        largest = left;
    }

    if (right < heapSize && array[right] > array[largest]) {
        largest = right;
    }

    if (index != largest) {
        exchangeElements(array, index, largest);

        maxHeap(array, heapSize, largest);
    }
}
public static void buildMaxHeap(int[] arry){
    if(arry==null||arry.length<=1)return;
    int half = arry.length / 2;
    for(int i=half;i>=0;i--){
        maxHeap(arry,arry.length,i);
    }
}
public static void HeapSort(int[] arry){
    if(null==arry||arry.length == 1)return;
    buildMaxHeap(arry);
    for (int i = arry.length - 1; i >= 1; i--) {
        exchangeElements(arry, 0, i);

        maxHeap(arry, i, 0);
    }
}
public static void main(String[] args) {
        int[] array = { 9, 0, 7, 6, 5, -4, 3, 2, 1, 0, -1, 2, -3 };
        printArray(array);
        //QuickSort(array,0,array.length-1);
        HeapSort(array);
        printArray(array);
    }
}

转载于:https://my.oschina.net/vintnee/blog/686490