7-9插入算法

public class D1 {

public static void main(String[] args) {
int []num={10,20,30,40,50};
int num2 []=new int[num.length+1];
for (int i = 0; i < num.length; i++) {
num2[i]=num[i];
}
int index=num2.length-1;
int cha=25;
for (int i = 0; i < num2.length; i++) {
if(num2[i]>cha){
index=i;
break;
}
}
for (int i = num2.length-1; i >index ; i--) {
num2[i]=num2[i-1];
}
num2[index]=cha;
for (int i = 0; i < num2.length; i++) {
System.out.println(num2[i]);
}

}

}

7-9插入算法

原文：http://www.cnblogs.com/mashiro/p/5655787.html