Position BinarySearch(List L, ElementType X)
{
int left = 0, right = L->Last, mid = 0;
while (left <= right)
{
mid = (left + right) / 2;
if (X == L->Data[mid])
return mid;
else if (X > L->Data[mid])
left = mid + 1;
else
right = mid - 1;
}
return NotFound;
}
pat二分查找
最新推荐文章于 2024-05-22 18:44:11 发布