【c语言】在一个有序数组中查找具体的某个数字n

慕兮-

已于 2024-07-16 21:20:48 修改

阅读量256

点赞数 11

文章标签： c语言算法 java

于 2024-07-14 16:00:08 首次发布

本文链接：https://blog.csdn.net/m0_68801993/article/details/140418140

版权

方法一：

int main()
{
   int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
   int k = 7;//要查找的数字
   int sz = sizeof(arr) / sizeof(arr[0]);
   int left = 0;
   int light = sz - 1;
   while (left <= light)
   {
       int mid = (left + light) / 2;//二分查找
       if (arr[mid] < k)
       {
           left = mid + 1;
       }
       else if (arr[mid] > 7)
       {
           light = mid - 1;
       }
       else
       {
           printf("找到了，下标是：%d\n", mid);
           break;
       }
   }
   if (left > light)
       printf("找不到\n");
   return 0;
}

方法二：

int binary_search(int arr[], int k, int sz)
{
   int left = 0;
   int right = sz - 1;
   while (left <= right)
   {
       int mid = (left + right) / 2;
       if (arr[mid] < k)
           left = mid + 1;
       else if (arr[mid] > k)
           right = mid - 1;
       else
           return mid;
   }
   return -1;
}
int main()
{
   int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
   int k = 7;
   int sz = sizeof(arr) / sizeof(arr[0]);
   int ret = binary_search(arr, k, sz);
   if (ret == -1)
   {
       printf("找不到");
   }
   else
   {
       printf("找到了，下标是%d\n", ret);
   }
   return 0;
}