Position BinarySearch(List L, ElementType X)
{
int beg = 1;
int end = L->Last;
while (beg <= end)
{
int mid = (beg + end) / 2;
if (L->Data[mid] == X)
return mid;
else if (L->Data[mid] < X)
beg = mid + 1;
else
end = mid - 1;
}
return NotFound;
}
转载于:https://www.cnblogs.com/ruoh3kou/p/9978800.html
相关资源：Notepad++(32位+64位)
