数组元素的倒序排列

#include<stdio.h>

void fun (inta[],int n)

{

    int i,t;

for(i=0;i<n/2;i++)

{

    t=a[i];

    a[i]=a[n-1-i];

    a[n-1-i]=t;

}

main()

{

int k[10]={1,2,3,4,5,6,7,8,9,10},i;

fun(k,5);

for(i=2;i<8;i++)

printf("%d\n",k[i]);

printf("\n");

}

}

//程序运行结果为:321678

 
 





猜你喜欢

转载自blog.csdn.net/qq_40374303/article/details/80037126