当前位置：网站首页>Binary search / half search

Binary search / half search

2022-07-22 11:30:00 【p29949】

// Find a specific number in an ordered array n.
//1 2 3 4 5 6 7 8 9 10
// Two points search / Binary search 

#include<stdio.h>
int main()
{
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	int sz = sizeof(arr) / sizeof(arr[0]);// The number of elements in the array 
	int left = 0;
	int right = sz-1;
	int k = 0;
	scanf("%d", &k);

	while (left<=right)
	{
		//int mid = (left + right) / 2;
		int mid = left + (right - left) / 2;
		if (arr[mid] < k)
		{
			left = mid + 1;
		}
		else if (arr[mid] > k)
		{
			right = mid - 1;
		}
		else
		{
			printf(" eureka , The subscript is :%d\n", mid);
			break;
		}
	}
	if (left > right)
		printf(" Can't find \n");

	return 0;
}

原网站

版权声明
本文为[p29949]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/203/202207212030565049.html