//插入排序
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] nums=new int[10];
for(int i=0;i<10;i++) {
nums[i]=(int)(10*Math.random()+1);
}
System.out.println("原数组:");
for(int e:nums)
System.out.print(e+" ");
Insert_Sort(nums);
System.out.println();
System.out.println("排序后的数组:");
for(int e:nums)
System.out.print(e+" ");
}
public static void Insert_Sort(int[] nums) {
for (int j = 1; j < nums.length; j++) {
int key = nums[j];
int i = j - 1;
while (i >= 0 && nums[i] > key) {
nums[i + 1] = nums[i];
i--;
}
nums[i+1]=key;
}
}
}
插入排序
最新推荐文章于 2024-12-13 15:13:27 发布