简单记录,以备后用
public class InsertSort {
public static void main(String[] args) {
int[] arr = { 49, 48, 55, 87, 33, 32, 66, -1, 22 };
insertSort(arr, arr.length);
System.out.println("排序后:");
for (int i : arr) {
System.out.print(i + "-->");
}
}
public static void insertSort(int[] a, int len) {
if (len <= 1) {
return ;
}
for(int i=1;i<len;++i) {
int value = a[i];
int j = i -1;
for(;j>=0;--j) {
if (a[j] > value) {
a[j+1] = a[j];
} else {
break;
}
}
a[j+1] = value;
}
}
}