#define N 7
void insert(int n[N],int num);
void insert(int n[N],int num){
int i;
for (i=0 ; i
if (num>n[i]) {
break;
}
}
for (int j=N-1; j>=i; j--) {
n[j+1]=n[j];
}
n[i]=num;
}
int main(int argc, const char * argv[]) {
int num[7];
printf("输入6个整数:");
for (int i=0; i<6; i++) {
scanf("%d",&num[i]);
}
insert(num, 51);
printf("插入数字后新数组为:\n");
for (int i=0; i<7; i++) {
printf("%d ",num[i]);
}
printf("\n");
return 0;
}
```
方法二:
```
int main(int argc, const char * argv[]) {
int num[N];
printf("输入6个整数:");
for (int i=0; i<6; i++) {
scanf("%d",&num[i]);
}
int insertNum;
printf("输入要插入的数字:");
scanf("%d",&insertNum);
for (int i=0; i
if (insertNum<=num[i]) {
continue;
}else{
//找到比他大的,替换数组中的元素,数组中元素取出来保存
int tempNum=num[i];
num[i]=insertNum;
insertNum=tempNum;
}
}
//insert(num, 51);
printf("插入数字后新数组为:\n");
for (int i=0; i
printf("%d ",num[i]);
}
printf("\n");
return 0;
}