int binary_search(int arr[],int n,int key) { int low=0,high=n-1; while(low<=high) { int mid=low+(high-low)>>1; if(arr[mid]>key) high=mid-1; else if(arr[mid]<key) low=mid+1; else return mid; } return -1; }
【模板】二分
猜你喜欢
转载自www.cnblogs.com/kannyi/p/9181740.html
今日推荐
周排行