插入排序

    科技2023-10-16  99

    public static void main(String[] args) { int[] arry = new int[] {2,45,36,72,34}; System.out.println("原数组:"); System.out.println(Arrays.toString(arry)); insertSort(arry); System.out.println(System.currentTimeMillis()); System.out.println("排序后的数组:"); System.out.println(System.currentTimeMillis()); System.out.println(Arrays.toString(arry)); } private static void insertSort(int[] arry) { int len = arry.length; int tmp =arry[0]; for (int i = 1; i < len; i++) { tmp = arry[i]; int j; for (j = i-1; j >= 0; j--) { if(arry[j] > tmp){ arry[j+1] = arry[j]; }else{ break; } } arry[j+1] = tmp; } }
    Processed: 0.009, SQL: 8