1、代碼:
package org.gzw.ch02;
public class InsertSort {
static public void sort(long[] arr){
long tmp = 0;
for(int i=1;i<arr.length;i++){
tmp = arr[i];
int j = i;
while(j>0 && arr[j-1]>=tmp){
arr[j] = arr[j-1];
j--;
}
arr[j] = tmp;
}
}
public static void main(String[] args) {
long[] l = new long[]{12,33,1,43,9,76,99,11,-21,9,-1};
System.out.print("初始數組:[");
for(int i=0;i<l.length;i++){
System.out.print(l[i] + ", ");
}
System.out.println("]");
sort(l); //插入算法
System.out.print("排序後的數組:[");
for(int i=0;i<l.length;i++){
System.out.print(l[i] + ", ");
}
System.out.println("]");
}
}
2、運行結果:
初始數組:[12, 33, 1, 43, 9, 76, 99, 11, -21, 9, -1, ]
排序後的數組:[-21, -1, 1, 9, 9, 11, 12, 33, 43, 76, 99, ]
備註:一個不錯網址 :
http://www.cnblogs.com/kkun/archive/2011/11/23/2260265.html