排序都有哪几种方法?请列举。用JAVA实现一个快速排序。

程序算法排序浏览:359收藏:2
答案:
本人只研究过冒泡排序、选择排序和快速排序,下面是快速排序的代码:
冒泡排序:
private static void bubbleSort(int[] array) {
    for (int i = 1; i < array.length; i++) {
        for (int j = 0; j < i; j++) {
            if (array[i] < array[j]) {
                int temp = array[i];
                array[i] = array[j];
                array[j] = temp;
            }
        }
    }
}

快速排序:
public class QuickSort {
    public void quickSort(String[] strDate, int left, int right) {
        String middle, tempDate;
        int i, j;
        i = left;
        j = right;
        middle = strDate[(i + j) / 2];
        do {
            while (strDate[i].compareTo(middle) < 0 && i < right)
                i++; // 找出左边比中间值大的数
            while (strDate[j].compareTo(middle) > 0 && j > left)
                j--; // 找出右边比中间值小的数
            if (i <= j) { // 将左边大的数和右边小的数进行替换
                tempDate = strDate[i];
                strDate[i] = strDate[j];
                strDate[j] = tempDate;
                i++;
                j--;
            }
        } while (i <= j); // 当两者交错时停止

        if (i < right) {
            quickSort(strDate, i, right);
        }
        if (j > left) {
            quickSort(strDate, left, j);
        }
    }

    public static void main(String[] args) {
        String[] strVoid = new String[] { "11", "66", "22", "0", "55", "22", "0", "32" };
        QuickSort sort = new QuickSort();
        sort.quickSort(strVoid, 0, strVoid.length - 1);
        for (int i = 0; i < strVoid.length; i++) {
            System.out.println(strVoid[i] + " ");
        }
    }
}