二分查找

#include <cstdio>#include <cstring>#include <cstdlib>#include <iostream>#define NUM 8using namespace std;int a[NUM];int binary_search(int b[],int low,int high,int key){    if(low<=high)    {        int mid = (low+high)/2;        if(b[mid]==key) return key;        else if(key<b[mid]) return binary_search(b,low,mid-1,key);        else if(key>b[mid]) return binary_search(b,mid+1,high,key);    }    else        return -1;}int main(){    int key;    scanf("%d",&key);    for(int i=0;i<NUM;i++)    {        scanf("%d",&a[i]);    }    int result = binary_search(a,0,NUM-1,key);    printf("%d",result);    return 0;}