插入排序
public class Insert {
public static void main(String[] args) {
int [] nums = {12,4,-6,2,66,1,4};
for (int i = 1; i < nums.length; i++) {
int temp = nums[i];
int j = 0;
for (; j < i; j++) {
if(nums[j]>temp) {
break;
}
}
if(j==i) {
continue;
}
for(int k = i;k>j;k--) {
nums[k] = nums[k-1];
}
nums[j] = temp;
}
for (int i : nums) {
System.out.println(i);
}
}
}