/** * 插入排序法 */ public class InsertionSort { static final int SIZE=10; public static void insertionSort(int[] a){ int i,j,t,h; for (i = 1; i <a.length ; i++) { t=a[i]; j=i-1; while (j>=0&&t<a[j]){ a[j+1]=a[j]; j--; } a[j+1]=t; System.out.print("第"+i+"步排序结果:"); for (h=0;h<a.length;h++){ System.out.print(a[h]+"\t"); } System.out.print("\n"); } } public static void main(String[] args) { int [] shuzu=new int[SIZE]; int i; for ( i = 0; i <SIZE ; i++) { shuzu[i]=(int)(100+Math.random()*(100+1)); } System.out.print("排序前的数组为:\n"); for ( i = 0; i < SIZE; i++) { System.out.print(shuzu[i]+"\t"); } System.out.print("\n"); insertionSort(shuzu); System.out.print("排序后的数组为:\n"); for ( i = 0; i < SIZE; i++) { System.out.print(shuzu[i]+"\t"); } System.out.print("\n"); } }
插入排序法-详解
最新推荐文章于 2024-01-24 00:58:08 发布