Position BinarySearch( List L, ElementType X ){
if(L==NULL)
return NotFound;
int left=1,right=L->Last,mid;
while(left<=right){
mid=(left+right)/2;
if(X==L->Data[mid])
return (left+right)/2;
else if(X<L->Data[(left+right)/2])
right=mid-1;
else
left=mid+1;
}
return NotFound;
}
6-10 二分查找
最新推荐文章于 2024-01-16 17:00:00 发布