5种排序的代码

public class Sort {
    // 插入
    public void sort(int[] data) {
        int temp;
        for (int i = 0; i < data.length; i++) {
            for (int j = i; (j > 0) && (data[j] > data[j - 1]); j--) {

                temp = data[j];
                data[j] = data[j - 1];
                data[j - 1] = temp;
            }
            System.out.println("data=" + data[i]);
        }
    }

    // 冒泡
    public int[] maopao(int[] data) {
        int temp;
        for (int i = 0; i < data.length; i++) {
            for (int j = i + 1; j < data.length - 1; j++) {
                if (data[i] < data[j]) {
                    temp = data[i];
                    data[i] = data[j];
                    data[j] = temp;
                }
            }
            System.out.println("data=" + data[i]);
        }

        return data;
    }

    // 选择法
    public static void xuanze(int[] data) {
        int temp;
        for (int i = 0; i < data.length; i++) {
            int lowIndex = i;
            for (int j = data.length - 1; j > i; j--) {
                if (data[j] > data[lowIndex]) {
                    lowIndex = j;
                }
            }
            temp = data[i];
            data[i] = data[lowIndex];
            data[lowIndex] = temp;
        }
    }

    // shell排序
    public void shell(int[] data) {
        for (int i = data.length / 2; i > 2; i /= 2) {
            for (int j = 0; j < i; j++) {
                insertSort(data, j, i);
            }
        }
        insertSort(data, 0, 1);
    }

    private void insertSort(int[] data, int start, int inc) {
        int temp;
        for (int i = start + inc; i < data.length; i += inc) {
            for (int j = i; (j >= inc) && (data[j] < data[j - inc]); j -= inc) {
                temp = data[j];
                data[j] = data[j - inc];
                data[j - inc] = temp;
            }
        }
    }

    public static void main(String[] args) {
        Sort sort = new Sort();
        int k[] = { 9, 7, 8, 6, 5, 4, 3, 2, 0 };
        // sort.sort(k);
        sort.maopao(k);
    }
}