package insertion;
import java.util.Arrays;
public class Test1 {
public static void main(String[] args) {
int[] numbers= {2,1,3,4,5,6,7,8,4,3,2,2,0,-1,-2,100,20,34332};
for (int i = 1; i < numbers.length; i++) {
int temp=numbers[i];//记录要插入的数据
int j = i-1;
for ( ;j>=0&& numbers[j]>temp ; j--) {//只有大于插入数据的数据才向右边移动
numbers[j+1]=numbers[j];
}
j++;
numbers[j]=temp;
}
System.out.println(Arrays.toString(numbers));
}
}
排序算法-插入排序
最新推荐文章于 2022-03-14 10:07:28 发布