二分查找分C++實現

#include<iostream>
using namespace std;
/*
2分查找法
優點：查找速度快，平均性能好。
缺點：待查表為有序表 
*/
int main()
{
int binSearch(const int*, int, int, int); 
int arr[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
cout << binSearch(arr, 0, 9, 5) << endl;
 
return 0;
} 


int binSearch(const int* Array,int start,int end,int key)
{
int left,right;
int mid;
left = start;
right = end;
//注釋中為遞歸算法，履行效力低，不推薦
/* 
if(key < Array[mid])
{
return(binSearch(Array, left, mid⑴, key));
}
else if(key > Array[mid])
{
return(binSearch(Array, mid+1, right, key));
}
else
return mid;
*/


while(left<=right)
{
mid = (left+right)/2;
if(key==Array[mid])
{
return mid;
}
else if(key<Array[mid])
{
right=mid⑴;
}
else if(key>Array[mid])
{
left=mid+1;
}
}
return ⑴;
}