AIJXB的博客

这里的排序都以升序为例1.插入排序public static void insertSort(int[] array) { for (int bound = 1;bound<array.length;bound++) { int tmp = array[bound]; int cur = bound-1; for (;cur>=0;cur--) { if (array[cu

1.插入排序 //升序为例 public static void insertSort(int[] array) { for (int bound = 1;bound<array.length;bound++) { int tmp = array[bound]; int cur = bound-1; ...