斐波那契数列和二分查找的算法（递归与非递归）

#include <iostream>
using namespace std;
long long fibonacci1(size_t n)//非递归算法
{
long long* fiboarry = new long long[n + 1];
fiboarry[0] = 0;
fiboarry[1] = 1;
for (size_t i = 2; i <= n; ++i)
{
fiboarry[i] = fiboarry[i - 1] + fiboarry[i - 2];
}
long long ret1 = fiboarry[n];

return ret1;


}




long long fibonacci2(size_t n)//递归算法
{
return n < 2 ? n : fibonacci2(n - 1) + fibonacci2(n - 2);
}

int main()
{   
cout<<fibonacci1(20)<<endl;
 
long long ret=fibonacci2(10);
cout << ret << endl;
}
//二分查找
int search1(int*Arry, int low, int hight, int k)//非递归
{
int mid;
while (low < hight)
{
mid = (low + hight) / 2;
if (Arry[mid] == k);
return mid + 1;
if (Arry[mid] > k)
{
hight = mid - 1;
}
else
low = mid + 1;
}
cout << "未找到"<<endl;
}
int search2(int*Arry, int low, int hight, int k)//递归法
{
int mid;
while (low < hight)
{
mid = (low + hight) / 2;
if (Arry[mid] == k)
return mid + 1;
if (k < Arry[mid])
{
hight = mid - 1;
return search2(Arry, low, hight, k);
}
if (k > Arry[mid])
{
low = mid + 1;
return search2(Arry, low, hight, k);
}


}


}
int main()
{
int Arry[] = { 1, 3, 8, 11, 16, 22, 55, 66, 74, 82, 97, 103 };
cout<<search1(Arry, 0, 11, 22)<<endl;
cout<<search2(Arry, 0, 11, 22)<<endl;
}