流程图:
代码实现:
#include <iostream>
using namespace std;
int array[10]={1,2,3,4,5,6,7,8,9,10};
//找到,返回value对应的key;没找到,返回-1
int BinarySearch(int array[],int num,int value){
int left,mid,right;
left=0,right=num-1,mid=(right-left)/2;
while(left<=right){
if(array[mid]>value) right=mid-1;
else if(array[mid]<value) left=mid+1;
else return mid;
}
return -1;
}
int main(){
int key=BinarySearch(array,sizeof(array)/sizeof(array[0]),5);
cout<<"索引:"<<key<<endl;
return 0 ;
}