c语言：使用二分查找法在1-10之间找到7

daydreamer'

于 2022-09-25 22:24:33 发布

阅读量306

点赞数

文章标签： c语言

本文链接：https://blog.csdn.net/weixin_65304454/article/details/127044401

版权


#include <string.h>
#include<stdio.h>
int binary_search(int arr[], int k,int sz)
{
	//int sz = sizeof(arr) / sizeof(arr[0]);
	int left = 0;
	int right = sz - 1;
	//int mid = (left + right) / 2;
	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 =17;
	int sz = sizeof(arr) / sizeof(arr[0]);
	int ret =binary_search(arr, k,sz);
	if (ret == -1)
	{
		printf("找不到\n");
	}
	else
	{
		printf("找到了，下标是：%d\n", ret);
	}
	return 0;
}

注意情况