64,652
社区成员
发帖
与我相关
我的任务
分享
#include<iostream>
using namespace std;
int binarySearchOne(int arr[],int l,int r,int temp)
{
int mid;
mid = (l+r)/2;
if( l > r )
return -1;
if(arr[mid] == temp)
return mid;
else if(temp < arr[mid])
binarySearchOne(arr,0,mid-1,temp);
else
binarySearchOne(arr,mid+1,r,temp);
return 0;
}
int binarySearchTwo(int arr[],int l,int r,int temp)
{
int mid;
mid = (l+r)/2;
if( l > r )
return -1;
if(arr[mid] == temp)
return mid;
else if(temp < arr[mid])
return binarySearchTwo(arr,0,mid-1,temp);
else
return binarySearchTwo(arr,mid+1,r,temp);
}
int main() {
int a[] = {1, 2, 3, 4, 5, 6};
cout << binarySearchOne(a, 0, 5, 6) << endl;
cout << binarySearchTwo(a, 0, 5, 6) << endl;
}