一、线性表的查找
①、顺序查找之二分查找
int BinSearch(RecType R[], int n, KeyType k)
{
int low = 0, high = n - 1, mid;
while(low <= high){
mid = (low + high) / 2;
if(k == R[mid].key)
return mid + 1;
if(k < R[mid].key)
high = mid - 1;
else
low = mid + 1;
}
return 0;
}
