Algorithm学习笔记 --- C语言实现二分查找

int BinSearch(SeqList *R, int n, KeyType k){int low = 0;int high = n - 1;int mid;while(low < high){if(R[low].key == k)return low;if(R[high].key == k)return high;mid = low + ((high - low) / 2);//注：此处如果使用low + high的结果大雨表达式结果类型所能表达的最大值时，//会产生溢出，结果不正确。if(R[mid].key == k)return mid;if(R[mid].key < k)low = mid + 1;elsehigh = mid - 1;}if (low > high)return -1;}