1.数组中找一个数,找到返回1否则返回-1
循环写法:
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[100];
for(int i=1;i<=50;i++)a[i]=i+1;
int left=2,right=51,mid,key=51;
while(left<=right)
{
mid=left+right;
mid/=2;
if(a[mid]==key)break;
if(a[mid]<key)left=mid+1;
else right=mid-1;
}
if(a[mid]==key)cout<<1<<endl;
else cout<<"-1";
}
递归写法:
#include<bits/stdc++.h>
using namespace std;
int a[100];
int B_find(int left,int right,int key)
{
int mid=left+right;
mid/=2;
if(a[mid]==key)return key;
if(a[mid]<key)return B_find(mid+1,right,key);
else return B_find(left,mid-1,key);
}
int main()
{
for(int i=1;i<=50;i++)a[i]=i+1;
int left=1,right=50,mid,key=33;
int ans=B_find(left,right,key);
if(ans==key)cout<<1<<endl;
else cout<<"-1";
}
2.找一个与目标误差小于给定精确度的数:
#include<bits/stdc++.h>
using namespace std;
int main()
{
double left=2,right=51,mid,key=23.123456789;
while(right-left>=0.00001||left-right>=0.00001)
{
mid=left+right;
mid/=2;
if(mid<key)left=mid;
else right=mid;
}
printf("%.9lf",mid);
}
3.找第一个大于等于某个数的元素的下标。
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[100];
for(int i=1;i<=50;i++)a[i]=i;
int left=1,right=50,mid,key=22,res;
while(left<=right)
{
mid=right+left;
mid/=2;
if(a[mid]>=key){res=mid;right=mid-1;}
else left=mid+1;
}
if(left<=50)cout<<res<<endl;
else cout<<-1<<endl;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[100];
for(int i=1;i<=50;i++)a[i]=i;
int left=1,right=50,mid,key=22,res;
while(left<=right)
{
mid=right+left;
mid/=2;
if(a[mid]>key){res=mid;right=mid-1;}
else left=mid+1;
}
if(left<=50)cout<<res<<endl;
else cout<<-1<<endl;
}