数组顺序颠倒——递归方法

#include<bits/stdc++.h>
using namespace std;
void reverse(int *A, int lo,int hi){
	if(lo<hi)
	
	{
		swap(A[lo],A[hi]);
		reverse(A,lo+1,hi-1);
	}
}
//验证
int main(){
	int A[]={0,1,2,3,4};
	reverse(A,0,4);
	for(int i=0;i<5;i++)
	cout<<A[i]<<" ";
	cout<<endl;
}

标签：std,reverse,递归,int,lo,void,namespace,颠倒,数组
来源： https://www.cnblogs.com/Los1r/p/15240030.html