排序

public class SortDemo {
public SortDemo() {
}

public static void main(String[] args) {
    int[] array = new int[]{23, 13, 49, 6, 31, 19, 28};
    quikSort(array, 0, array.length - 1);
    sout(array);
}

public static void InsertSort(int[] array) {
    int len = array.length;

    for(int i = 1; i < len; ++i) {
        int temp = array[i];

        int p;
        for(p = i - 1; p >= 0 && array[p] > temp; --p) {
            array[p + 1] = array[p];
        }

        array[p + 1] = temp;
    }

}

public static void chooseSort(int[] array) {
    int min_pos = 2147483647;

    for(int i = 0; i < array.length - 1; ++i) {
        min_pos = findMin(array, i + 1, array.length);
        swap(array, i, min_pos);
    }

}

public static void bubbleSort(int[] array) {
    int len = array.length;

    for(int i = 0; i < len; ++i) {
        for(int j = 0; j < len - i - 1; ++j) {
            if(array[j + 1] < array[j]) {
                swap(array, j + 1, j);
            }
        }
    }

}

public static void quikSort(int[] array, int low, int high) {
    if(low < high) {
        int p = Partition1(array, low, high);
        quikSort(array, low, p - 1);
        quikSort(array, p + 1, high);
    }

}

public static int Partition1(int[] array, int low, int high) {
    int p;
    for(p = array[low]; low < high; array[high] = array[low]) {
        while(array[high] > p && low < high) {
            --high;
        }

        for(array[low] = array[high]; array[low] < p && low < high; ++low) {
            ;
        }
    }

    array[low] = p;
    return low;
}

public static int findMin(int[] array, int start, int end) {
    int min = 2147483647;
    int min_pos = 2147483647;

    for(int i = start; i < end; ++i) {
        if(min > array[i]) {
            min = array[i];
            min_pos = i;
        }
    }

    return min_pos;
}

public static void swap(int[] array, int i, int j) {
    int temp = array[i];
    array[i] = array[j];
    array[j] = temp;
}

public static void sout(int[] array) {
    for(int i = 0; i < array.length; ++i) {
        System.out.print(array[i] + "\t");
    }

    System.out.println("");
}
}