整数二分排序算法:
什么时候会选择用到?——给定一个按照升序排列的长度为n的整数数组
二分程序虽然简单,但是如果写之前不考虑好想要查找的是什么,十有八九会是死循环或者查找错误,就算侥幸写对了也只是运气好而已。
用二分去查找元素要求数组的有序性或者拥有类似于有序的性质
模板代码:
bool check(int x) {}
int bsearch_1(int l, int r)
{
while (l < r)
{
int mid = l + r >> 1;
if (check(mid)) r = mid;
else l = mid + 1;
}
return l;
}
int bsearch_2(int l, int r)
{
while (l < r)
{
int mid = l + r + 1 >> 1;
if (check(mid)) l = mid;
else r = mid - 1;
}
return l;
}
int l = 0, r = n - 1;
while (l < r) {
int mid = l + r >> 1;
if (a[mid] < x) l = mid + 1;
else r = mid;
}
int l1 = l, r1 = n;
while (l1 + 1 < r1) {
int mid = l1 + r1 >> 1;
if (a[mid] <= x) l1 = mid;
else r1 = mid;
}
实战代码:
#include <iostream>
using namespace std;
const int N = 1e6+10;
int n,m;
int q[N];
int main()
{
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++) scanf("%d",&q[i]);
while(m--) {
int x;
scanf("%d",&x);
int l=0,r=n-1;
while(l<r)
{
int mid = l+r >> 1;
if(q[mid]>=x) r=mid;
else l = mid+1;
}
if(q[l]!=x) cout << "-1 -1" << endl;
else
{
cout << l << ' ';
int l=0,r=n-1;
while(l<r)
{
int mid = l+r+1 >> 1;
if(q[mid]<=x) l=mid;
else r=mid-1;
}
cout << l << endl;
}
}
return 0;
}
浮点数二分代码模板:
bool check(double x) {}
double bsearch_3(double l, double r)
{
const double eps = 1e-6;
while (r - l > eps)
{
double mid = (l + r) / 2;
if (check(mid)) r = mid;
else l = mid;
}
return l;
}
实战代码
#include<iostream>
using namespace std;
int main()
{
double x;
cin >> x;
double l = -10000,r=10000;
while(r - l > 1e-8)
{
double mid = (l + r) / 2;
if(mid * mid * mid >= x) r = mid;
else l = mid;
}
printf("%lf", l);
return 0;
}