#include<iostream>
using namespace std;
int sum(int A[], int lo, int hi)
{
if (hi - lo < 2)
{
return A[lo];
}
int mi = (lo + hi) >> 1;
return sum(A, lo, mi) + sum(A, mi, hi);
}
int main()
{
int a[] = { 1,2,3,4,5,6,7,8,9,10 };
cout << "the result is :" << sum(a, 0,10) << endl;
system("pause");
return 0;
}
009.数组求和算法(二分递归)
最新推荐文章于 2023-06-12 11:37:08 发布