【练习吧 · 数据结构】二分查找 - C 语言

mid = l + (l-r)>>1;
mid = (l+r)>>1;
为什么第二个式子更好：为了防止(l+r)过大超时

/* 具体二分如下：
**（已经从小到大排好序）
**arr[]存放数据
**size是arr[]的大小
** x是想要查找的数

int binsearch(int arr[],int size,int x)
{
    int left = 0;
    int right = size-1;
    while(left<=right)
    {
        int mid = left + (left + right)>>1;
        if(x==arr[mid])
        {
            return mid;
        }
        else if(x>arr[mid])
        {
            left = mid + 1;
        }
        else
        {
            right = mid - 1;
        }
    }
    return -1;//如果没有找到x，则返回-1
}

• 具体调用如下，完整代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 1005
using namespace std;
int arr[maxn];

int binsearch(int arr[],int size,int x)
{
    int left = 0;
    int right = size-1;
    while(left<=right)
    {
        int mid = left + (left + right)>>1;
        if(x==arr[mid])
        {
            return mid;
        }
        else if(x>arr[mid])
        {
            left = mid + 1;
        }
        else
        {
            right = mid - 1;
        }
    }
    return -1;//如果没有找到x，则返回-1
}
int main()
{
    int n,x;
    scanf("%d%d",&n,&x);//数组的大小,要查的数
    memset(arr,0,sizeof(arr));
    for(int i=0;i<n;i++)
    {
        scanf("%d",&arr[i]);
    }
    sort(arr,arr+n);
    int mid = binsearch(arr,n,x);
    printf("%d\n",mid);
    return 0;
}

#include<cstdio>
#include<cmath>

const double eps = 1e-6;
double f(double x)
{
    return x*x*x - 5*x*x + 10*x - 80;
}
int main()
{
    double mid,left = 0,right = 100,y;
    mid = left + (right - left)/2;
    y = f( mid );
    while( fabs(y) > eps)
    {
        if(y > 0)
            right = mid;
        else
            left = mid;

        mid = left + (right - left)/2;
        y = f(mid);
    }
    printf("%.8f\n",mid);
    return 0;
}