折半查找<二分查找>

折半条件:必须在一个有序数组内进行。
例如:在一个数组中查找一个数找到就输出该元素下标,如果没找到就输出-1:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
intbin_search(int*p,intx, int n)
{
                int left = 0;
                int right = n - 1;
                while (left <= right)
                {
                                int i = 0;
                                i = ( right-left)/2+left;//(left&right) + ((left^right) >> 1)
                                                                  //right/2+left/2;
                                                                   //如果left和right很大,要防止left+right发生溢出
                                if (p[i] > x)
                                {
                                                right = i - 1;
                                }
                                else if (p[i] < x)
                                {
                                                left = i + 1;
                                }
                                else
                                                return i;
                }
                return -1;
}
intmain()
{
                printf("请输入数组的大小:_" );
                int n = 0;
                scanf("%d", &n);
                printf("请输入要查找的元素\n" );
                int x = 0;
                scanf("%d", &x);
                int *p = (int *)calloc(n, sizeof(int));           //采用动态内存,提高对内存的利用
                if (p == NULL)
                {
                                printf("out of memory\n");
                                exit(1);
                }
                printf("请初始化数组\n" );
                for (int i = 0; i < n; i++)
                {
                                scanf("%d", &p[i]);
                }
                int ret=bin_search(p,x,n);
                printf("%d\n", ret);
                free(p);
                system("pause");
                return 0;
}

转载于:https://www.cnblogs.com/Sunnylunch/p/5483133.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值