public class Insertion_Sort {
/**
* @param args
*
*插入排序
*自己实现
*最坏的运行时间是N^2
*yy
*/
public static void insert_sort(int a[]){
for(int j=1;j<a.length;j++){
int key=a[j];
int i=j-1;
while(i>=0&&a[i]>key){
a[i+1]=a[i];
i--;
}
a[i+1]=key;
}
}
public static void print(int a[]){
for(int i=0;i<a.length;i++){
System.out.print(a[i]+"\t");
}
System.out.println();
}
public static void main(String[] args) {
int a[]=new int[]{1,5,3,7,2,0};
print(a);
insert_sort(a);
print(a);
}
}