利用函数在有序数组中找到数

最新推荐文章于 2022-10-29 21:49:05 发布

Dzu

最新推荐文章于 2022-10-29 21:49:05 发布

阅读量85

点赞数

分类专栏： C题文章标签： c语言

本文链接：https://blog.csdn.net/m0_62513305/article/details/121105891

版权

C题专栏收录该内容

46 篇文章 1 订阅

订阅专栏

#include <stdio.h>
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 k = 0;
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	printf("输入一个数字:>");
	scanf("%d", &k);
	int sz = sizeof(arr) / sizeof(arr[0]);
	int ret = binary_search(arr, k, sz);
	if (-1 == ret)
		printf("找不到\n");
	else
		printf("找到了\n%d的下标是%d", k, ret);
	return 0;
}

#include <stdio.h>
int binary_search(int arr[], int k, int sz)
{
	int left = 0;
	int right = sz - 1;
	for (; 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 k = 0;
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	printf("输入一个数字:>");
	scanf("%d", &k);
	int sz = sizeof(arr) / sizeof(arr[0]);
	int ret = binary_search(arr, k, sz);
	if (-1 == ret)
		printf("找不到\n");
	else
		printf("找到了\n%d的下标是%d", k, ret);
	return 0;
}