折半查找的实现,实验室做的!#include using namespace std; int BinSearch1(int r[],int n,int k) { int mid; int low=1;int high=n;int count=0; while(low