插入排序
代码示例
import java.util.Arrays;
class Insertorder {
public static void main(String[] args) {
int[] intArr = {1,3,2,6,5,4,8,9,7};
System.out.println("排序前:" + Arrays.toString(intArr));
int len = intArr.length;
for (int i=1; i<len; i++) {
int tmp = intArr[i];
int j = i-1;
while(j>=0 && tmp < intArr[j]) {
intArr[j+1] = intArr[j];
j --;
}
int end = j + 1;
intArr[end] = tmp;
}
System.out.println("排序后:" + Arrays.toString(intArr));
}
}
运行结果
排序前:[1, 3, 2, 6, 5, 4, 8, 9, 7]
排序后:[1, 2, 3, 4, 5, 6, 7, 8, 9]
进程已结束,退出代码0