优化算法实现数据结构第一章的二分搜索程序

实现折半查找的算法，代码如下：int BinSearch(int *pArray, int nKey, int n) { tint Low = 0; tint High = n-1; tint nFound = 0; tint Mid; twhile (Low <= High) { Mid = (Low + High) / 2; tif (nKey < pArray xss=removed> pArray[Mid]) Low = Mid + 1; telse { nFound = 1; break; } } treturn nFound; }