二分查找

WANGYULIN123 · 2025-03-15 16:58:31 · 个人记录

int l=1,r=n;,mid,target;
cin>>target;
while(l<=r){
mid=(l+r)/2;
if(arr[mid]==target)
break;
else if(arr[mid]<target)
l=mid+1;
else
r=mid-1;
}
if(arr[mid]==target)
cout<<"找到了"<<endl;
else
cout<<"没找到";