Java排序三：直接插入排序

public class TestDemo {public static void main(String[] args) {int[] arr = new int[10];Random random = new Random();for (int i = 0; i < arr.length; i++) {arr[i] = random.nextInt(100);}display(arr);sort(arr);display(arr);}private static void sort(int[] arr) {for (int i = 1, len = arr.length; i < len; i++) {int j = i - 1;int tmp = arr[i];while (j >= 0 && arr[j] > tmp) {arr[j + 1] = arr[j];j--;}arr[j + 1] = tmp;}}private static void swap(int[] arr, int i, int j) {if (i == j) {return;}arr[i] = arr[i] ^ arr[j];arr[j] = arr[i] ^ arr[j];arr[i] = arr[i] ^ arr[j];}private static void display(int[] arr) {for (int i = 0, len = arr.length; i < len; i++) {System.out.print(arr[i] + "  ");}System.out.println();}}