import java.util.Arrays;
public class InsertionSort {
public static void main(String[] args) {
int[] array = new int[6];
for (int i = 0; i < 6; i++) {
array[i] = (int) (Math.random() * 100);
}
System.out.println("待排序的数据为:" + Arrays.toString(array));
System.out.println("开始排序*********");
insertionSort(array);
System.out.println("排序过后的数据为:" + Arrays.toString(array));
}
public static void insertionSort(int[] array) {
int len = array.length;
for (int i = 1; i < len; i++) {
int insertVal = array[i]; //当前需要插入的值
int index = i - 1; //从当前数据的前一个数据开始判断是否插入
while(index >=0 && insertVal < array[index]) {
array[index + 1] = array[index];
index--;
}
array[index + 1] = insertVal;
}
}
}
for..while..插入排序的实现
最新推荐文章于 2022-10-28 23:24:39 发布