008.数组求和算法（线性递归）

#include<iostream>

using namespace std;

int sum(int A[], int n) 
{
    if (1 > n) 
        return 0; 
    else 
        return sum(A, n - 1) + A[n - 1];
} 

int main()
{
    int a[] = { 1,2,3,4,5,6,7,8,9,0 };
    cout << "the result is :" << sum(a, 10) << endl;
    system("pause");
    return 0;
}