public void testInsertArithmetic(){
int[] array = new int[5];
array[0] = 24;
array[1] = 30;
array[2] = 2;
array[3] = 22;
array[4] = 1;
insertArithmetic(array);
for (int i=0;i<array.length;i++) {
System.out.println("array[" + i + "]:" + array[i]);
}
}
/**
* 方法用途描述: 插入排序算法
* 实现逻辑描述: 上面测试数组当从小到大排序(循环次数:8),当从大到小排序(循环次数:2)
*/
public void insertArithmetic(int[] array){
int exeCount = 0;
for(int i=1;i<array.length;i++){
int tempInt = array[i];
int j;
for(j=i-1;j>=0&&tempInt<array[j];j--){
array[j+1] = array[j];
exeCount++;
}
array[j+1] = tempInt;
}
System.out.println("=========执行次数:"+exeCount);
}
int[] array = new int[5];
array[0] = 24;
array[1] = 30;
array[2] = 2;
array[3] = 22;
array[4] = 1;
insertArithmetic(array);
for (int i=0;i<array.length;i++) {
System.out.println("array[" + i + "]:" + array[i]);
}
}
/**
* 方法用途描述: 插入排序算法
* 实现逻辑描述: 上面测试数组当从小到大排序(循环次数:8),当从大到小排序(循环次数:2)
*/
public void insertArithmetic(int[] array){
int exeCount = 0;
for(int i=1;i<array.length;i++){
int tempInt = array[i];
int j;
for(j=i-1;j>=0&&tempInt<array[j];j--){
array[j+1] = array[j];
exeCount++;
}
array[j+1] = tempInt;
}
System.out.println("=========执行次数:"+exeCount);
}