Java算法 - 插入排序

插入排序，升序。釋義參考百度百科

public static void insertionSort(int[] ints) {
    for (int i = 1; i < ints.length; i++) {
        int temp = ints[i];
        int j = i - 1;
        while (j >= 0 && ints[j] > temp) {
            ints[j + 1] = ints[j];
            j--;
        }
        ints[j + 1] = temp;
    }
}

 

測試代碼：

public class InsertionSort {
    public static void main(String[] args) {
        int[] ints = {9, 12, 0, 5, -1};
        insertionSort(ints);
        System.out.println(Arrays.toString(ints));
    }

    public static void insertionSort(int[] ints) {
        for (int i = 1; i < ints.length; i++) {
            int temp = ints[i];
            int j = i - 1;
            while (j >= 0 && ints[j] > temp) {
                ints[j + 1] = ints[j];
                j--;
            }
            ints[j + 1] = temp;
        }
    }
}