【JAVA】排序

public static void main(String[] args) {
        int[] list = {27, 76, 47, 23, 7, 32, 19, 86};
        bubbleSort(list);
}

// 冒泡排序
public static void bubbleSort(int[] list) {
        int len = list.length;
        for (int i = 0; i < len - 1; i++) {
            for (int j = 0; j < len - 1 - i; j++) {
                if (list[j] > list[j + 1]) {
                    int temp = list[j];
                    list[j] = list[j + 1];
                    list[j + 1] = temp;
                }
            }
        }
}

//直接插入排序算法
public static void insertSort(int[] list) {
        int len = list.length;
        for (int i = 1; i < len; i++) {
            int temp = list[i];
            int j;
            for (j = i - 1; j >= 0 && list[j] > temp; j--) {
                list[j + 1] = list[j];
            }
            list[j + 1] = temp;
        }
}