顺序表的就地逆置算法,文档中有程序实现算法的代码与可运行源程序

				#include
				using namespace std;
				
				#define N  10
				
				void main()
				{ 
					int i,j,t;
				    int list[N] = {1,2,3,4,5,6,7,8,9,10};
					cout					for(i=0;i						    cout							cout				    
					    for(i=0,j=N-1;i				    {     
				         t= list[i];
				         list[i] = list[j];
				         list[j] = t;
				     }
					cout				    for(i=0;i						  cout					system("pause");
				}