![](https://cos-cdn.shuashuati.com/pipixue-wap/2020-1230-1107-53/ti_inject-812ce.png)
下面的功能是实现( )算法。 struct record{int key; int others;}; int bisearch(struct record r[ ], int k) { int low=0,mid,high=n-1; while(low<=high) { mid=(low+high)/2 ; if(r[mid].key==k) return(mid+1); else if( r[mid].key>k ; ) high=mid-1;else low=mid+1; } return(0); }