写代码可以在整型有序数组中查找想要的数字，找到了返回下标，找不到返回-1.（折半查找）

最新推荐文章于 2020-11-13 00:26:11 发布

wang_0712

最新推荐文章于 2020-11-13 00:26:11 发布

阅读量405

点赞数

本文链接：https://blog.csdn.net/wang_0712/article/details/80366224

版权

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<windows.h>


int Find(int X, int Y, int key, int *p)
{
    int mid = (X + Y) / 2;
    while ((X <= Y) && (*(p + mid) != key))
    {
        mid = (X + Y) / 2;
        {
            if (*(p + mid)> key)
                Y = mid - 1;
            else if (*(p + mid) < key)
                X = mid + 1;
            else if (*(p + mid) == key)
                return mid;
        }
    }
    while ((X > Y) && (*(p + mid) != key))
    {
        return -1;
    }
    system("pause");
    return 0;
}
int main()
{
    int arr[10] = { 1, 3, 5, 7, 9, 11, 13, 15, 17, 19 };
    int a = 0;
    int lift = 0;
    int right = sizeof(arr) / sizeof(arr[0]);


    printf("请输入要查找的数字：");
    scanf("%d", &a);
    while (Find(lift, right, a, arr) != -1)
    {
        printf("找到了,下标是%d\n", Find(lift, right, a, arr));
        break;
    }
    while (Find(lift, right, a, arr) == -1)
    {
        printf("找不到\n");
        break;
    }
    system("pause");
    return 0;
}