数据结构之数组翻转的实现方法

#include<stdio.h> #define M 20  void fun(int *x,int n) {   int *i, *j, *p, m=n/2;   i = x;   j = x+n-1;   p = x+m;   for( ; i<p; ++i,--j)   {     int t = *i;     *i = *j;     *j = t;   } }  void main() {   int i,a[M],n;   printf("Enter n(n<20):/n");   scanf("%d",&n);   printf("The original array:/n");   for(i=0; i<n; ++i)    {     scanf("%d", a+i);   }   fun(a,i);   printf("/nThe array inverted:/n");   for(i=0; i<n; ++i)    {     printf("%d ", *(a+i));   }     printf("/n"); } 

#include<iostream> #define M 20  void fun(int *x,int n) {   int *i, *j, *p, m=n/2;   i = x;   j = x+n-1;   p = x+m;   for( ; i<p; ++i,--j)   {     std::swap(*i,*j);   } }  void main() {   <span style="white-space:pre">  </span>int i,a[M],n; <span style="white-space:pre">  </span>std::cout<<"Enter n(n<20):"<<std::endl;   std::cin>>n;   std::cout<<"The original array:"<<std::endl;   <span style="white-space:pre">  </span>for(i=0; i<n; ++i)    {     std::cin>>*(a+i);   }   <span style="white-space:pre"> </span> fun(a,i);   std::cout<<std::endl<<"The array inverted:"<<std::endl;   <span style="white-space:pre">  </span>for(i=0; i<n; ++i)    {     std::cout<<*(a+i)<<" ";   }   std::cout<<std::endl; } 

<?php $arrOrigin = array(1,2,3,4,5,6,7,8,9,10); $arrReverse = array_reverse($arrOrigin); echo '原始数组：'; print_r($arrOrigin); echo '<br/>'; echo '翻转后的数组：'; print_r($arrReverse); ?>