插入排序

/**
* Created by xuxiaoyu on 2015/6/25.
*/
import java.util.Scanner;
class insertSort {

@SuppressWarnings("resource")
public static void main(String[] args) {
int a[] = { 2, 4, 6, 8, 9, 22, 55 };
int[] b=new int[a.length+1];
Scanner in;
in = new Scanner(System.in);
int insertNum=in.nextInt();
for (int i = 0; i < a.length; i++) {
if(i==(a.length-1))//当所有的数都是比insertNum小的时候，直接将数字b的最后位置留给insertNum
{
b[i+1]=insertNum;
for(int l=0;l<a.length;l++)
b[i]=a[i];
}
if(insertNum<a[i])
{
b[i]=insertNum;
for(int m=i;m<a.length;m++)
b[m+1]=a[m];
break;
}
b[i]=a[i];
}
for (int k = 0; k < b.length; k++)
System.out.print(b[k] + "、");
}
}