希尔排序

    科技2023-10-16  70

    public static void shellSort(int[] arry){ int drr[] = {5,3,1}; for (int i : drr ){ shell(arry , i); } } /* * 稳定性:不稳定 因为发生了跳跃式的交换*/ private static void shell(int[] arry, int gap) { int len = arry.length; int tmp =arry[0]; for (int i = gap; i < len; i++) { tmp = arry[i]; int j; for (j = i-gap; j >= 0; j-=gap) { if(arry[j] > tmp){ arry[j+gap] = arry[j]; }else{ break; } } arry[j+gap] = tmp; } }
    Processed: 0.015, SQL: 9