void inv(int x[], int n) /*形参x是数组名*/
{
int temp, i, j, m = (n - 1) / 2;
for (i = 0; i <= m; i++)
{
j = n - 1 - i;
temp = x[i]; x[i] = x[j]; x[j] = temp;
}
return;
}
int main()
{
int i, a[10] = { 3,7,9,11,0,6,7,5,4,2 };
printf("The original array:\n");
for (i = 0; i<10; i++)
printf("%d,", a[i]);
printf("\n");
inv(a, 10);
printf("The array has benn inverted:\n");
for (i = 0; i<10; i++)
printf("%d,", a[i]);
printf("\n");
return 0;
}
将数组a中的n个整数按相反顺序存放(数值元素倒序排列)
最新推荐文章于 2023-03-27 21:51:05 发布