排序-插入-java

public class Test {
    public static void main(String[] args) {
        int[] arr = {5, 2, 6, 8, 9, 1};
        if (arr == null || arr.length <= 2) {
            return;
        }
        for (int i = 0; i < arr.length - 1; i++) {
            //插入排序：类似打扑克，抓一个数，判断数据在哪个位置，插入进去即可
            for (int j = i; j >= 0 && arr[j] > arr[j + 1]; j--) {
                swap(arr, j, j + 1);
            }
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i]);
        }
    }

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