#include
int main()
{
int a[9]={1,2,3,4,6,9,12,23,45},b[10],i,j,n;
scanf("%d",&n);
for(i=0,j=0;i {if(a[i] if(a[i]>n) b[j]=n;
printf("%d ",b[j]);
break;}
for(i,j=j+1;i<9,j<10;i++,j++)
{b[j]=a[i];
printf("%d ",b[j]);}
printf("\n");
return 0;
}
#include <stdio.h>
int main()
{
int a[9]={1,2,3,4,6,9,12,23,45},b[10],i,n;
n=5;
for(i=0;i<9;i++)
{if(a[i]<n) b[i]=a[i]; else break; }
b[i] = n;
while (++i != 10)
b[i]=a[i-1];
for(i=0;i<10;i++)
printf("%d ", b[i]);
printf("\n");
return 0;
}
给你一个方法,将a0-a8赋值给b0-b8,将n赋值给b9.
然后对数组进行冒泡排序。很简单