rwkj 1518

最新推荐文章于 2014-08-11 22:42:00 发布

weixin_30249203

最新推荐文章于 2014-08-11 22:42:00 发布

阅读量72

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/2014acm/p/3902507.html

本文提供了一个使用二分查找算法的C语言实现示例。该算法用于在一个有序数组中查找指定元素的位置。如果找到该元素，则返回其下标；若未找到，则返回特定提示信息。代码还展示了如何从标准输入读取数据。

#include<stdio.h>
int f(int a[],int low,int high,int x)
{    int mid;
     while (low<=high)
     {
        mid=(low+high)/2;
        if(a[mid]>x) high=mid-1;
            else if(a[mid]<x) low=mid+1;
                else return mid+1; 
     }
     return 0;
}

int main()
{
    int a[30],n,i,x,y;

    while(scanf("%d",&n)!=EOF)
    {
        for(i=0;i<=n;i++)
        scanf("%d",&a[i]);
        x=a[n];
        y=f(a,0,n,x);
        if (  y==0 ) printf("No found!\n"); 
        else printf("%d\n",y);
    }
    return 0;
}

View Code

#include<stdio.h>
int f(int a[],int low,int high,int x)
{    int mid;
     while (low<=high)
     {
        mid=(low+high)/2;
        if(a[mid]>x) high=mid-1;
            else if(a[mid]<x) low=mid+1;
                else return mid+1;
     }
     return 0;
}

int main()
{
int a[30],n,i,x,y;

    while(scanf("%d",&n)!=EOF)
    {
        for(i=0;i<=n;i++)
        scanf("%d",&a[i]);
        x=a[n];
        y=f(a,0,n,x);
        if ( y==0 ) printf("No found!\n");
        else printf("%d\n",y);
    }
    return 0;
}

#include<stdio.h>
int a[30],x;
int f(int low,int high)
{    int mid;
     while (low<=high)
     {
        mid=(low+high)/2;
        if(a[mid]>x) high=mid-1;
            else if(a[mid]<x) low=mid+1;
                else return mid; 
     }
     return -1;
}

int main()
{
    int n,i,y;
    while(scanf("%d",&n)!=EOF)
    {   for(i=0;i<=n;i++)
          scanf("%d",&a[i]);
        x=a[n];
        y=f(0,n-1);
        if (  y==-1 ) printf("No found!\n"); 
        else printf("%d\n",y+1);
    }
    return 0;
}

View Code

#include<stdio.h>
int a[30],x;
int f(int low,int high)
{    int mid;
     while (low<=high)
     {
        mid=(low+high)/2;
        if(a[mid]>x) high=mid-1;
            else if(a[mid]<x) low=mid+1;
                else return mid;
     }
     return -1;
}

int main()
{
    int n,i,y;
    while(scanf("%d",&n)!=EOF)
    {   for(i=0;i<=n;i++)
          scanf("%d",&a[i]);
        x=a[n];
        y=f(0,n-1);
        if ( y==-1 ) printf("No found!\n");
        else printf("%d\n",y+1);
    }
    return 0;
}

#include<stdio.h>
int f(int a[],int low,int high,int x)
{    int mid;
     while (low<=high)
     {
        mid=(low+high)/2;
        if(a[mid]>x) high=mid-1;
            else if(a[mid]<x) low=mid+1;
                else return mid; 
     }
     return -1;
}

int main()
{
    int a[30],n,i,x,y;

    while(scanf("%d",&n)!=EOF)
    {
        for(i=0;i<=n;i++)
        scanf("%d",&a[i]);
        x=a[n];
        y=f(a,0,n,x);
        if (  y==-1 ) printf("No found!\n"); 
        else printf("%d\n",y+1);
    }
    return 0;
}

View Code

int main()
{
int a[30],n,i,x,y;

    while(scanf("%d",&n)!=EOF)
    {
        for(i=0;i<=n;i++)
        scanf("%d",&a[i]);
        x=a[n];
        y=f(a,0,n,x);
        if ( y==-1 ) printf("No found!\n");
        else printf("%d\n",y+1);
    }
    return 0;
}

#include<stdio.h>
int f(int a[],int low,int high,int x)
{    int mid;
     while (low<=high)
     {
        mid=(low+high)/2;
        if(a[mid]>x) high=mid-1;
            else if(a[mid]<x) low=mid+1;
                else return mid+1; 
     }
     return -1;
}

int main()
{
    int a[30],n,i,x,y;

    while(scanf("%d",&n)!=EOF)
    {
        for(i=0;i<=n;i++)
        scanf("%d",&a[i]);
        x=a[n];
        y=f(a,0,n,x);
        if (  y==-1 ) printf("No found!\n"); 
        else printf("%d\n",y);
    }
    return 0;
}

View Code

#include<stdio.h>
int f(int a[],int low,int high,int x)
{    int mid;
     while (low<=high)
     {
        mid=(low+high)/2;
        if(a[mid]>x) high=mid-1;
            else if(a[mid]<x) low=mid+1;
                else return mid+1;
     }
     return -1;
}

int main()
{
int a[30],n,i,x,y;

    while(scanf("%d",&n)!=EOF)
    {
        for(i=0;i<=n;i++)
        scanf("%d",&a[i]);
        x=a[n];
        y=f(a,0,n,x);
        if ( y==-1 ) printf("No found!\n");
        else printf("%d\n",y);
    }
    return 0;
}

转载于:https://www.cnblogs.com/2014acm/p/3902507.html