二分查找的递归与1非递归算法

int bsearchRecursive(int *data,int low,int high,int key){int mid=0;if(low<high){mid=(low+high)/2-1;printf("index:%d,value:%d/n",mid,*(data+mid));if(*(data+mid)>key)return bsearchRecursive(data,low,mid-1,key);else if(*(data+mid)<key)return bsearchRecursive(data,mid+1,high,key);else return mid;}return -1;}int bsearchNoneRecursive(int *data,int high,int key){int mid=0;int low=0;while(low<high){mid=(low+high)/2-1;printf("index:%d,value:%d/n",mid,*(data+mid));if(*(data+mid)>key) high=mid-1;else if(*(data+mid)<key) low=mid+1;else return mid;}return -1;}