下列程序的输出结果是#define N 20void fun (int a[ ],int n,int m){int i,j;for (i=m;i>n;i--)a[i+1]=a[i];}main(){int i,a[N]={1,2,3,4,5,6,7,8,9,10};fun(a,2,9);for(i=0;i

下列程序的输出结果是#define N 20void fun (int a[ ],int n,int m){int i,j;for (i=m;i>n;i--)a[i+1]=a[i];}main(){int i,a[N]={1,2,3,4,5,6,7,8,9,10};fun(a,2,9);for(i=0;i
下列程序的输出结果是
#define N 20
void fun (int a[ ],int n,int m)
{int i,j;
for (i=m;i>n;i--)a[i+1]=a[i];
}
main()
{int i,a[N]={1,2,3,4,5,6,7,8,9,10};
fun(a,2,9);
for(i=0;i

下列程序的输出结果是#define N 20void fun (int a[ ],int n,int m){int i,j;for (i=m;i>n;i--)a[i+1]=a[i];}main(){int i,a[N]={1,2,3,4,5,6,7,8,9,10};fun(a,2,9);for(i=0;i
最后的数组 a[20] = {1,2,3,4,4,5,6,7,8,9,10}
程序不完全排序