[算法]数组倒置

算法复杂度O(n)
将规模为n的问题,分成n-2的规模,并具有相同的问题形式

#include 
#include 
#include 
using namespace std;
void reverse(int* A, int low, int high)
{
    if (low < high)
    {
        swap(A[low], A[high]);
        reverse(A, low + 1, high - 1);
    }
}
int main()
{
    int A[10] = { 1,2,3,4,5,6,7,8,9,10 };
    reverse(A, 0, 9);

    for (auto a : A)
    {
        cout << a << " ";
    }
    cout << endl;
    cout << "hello world" << endl;
    return 0;
}