二分查找代码实现及讲解

#include <stdio.h>
int main()
{
	int arr[] = { 2,5,8,10,11,15,20 };
	int len = sizeof(arr) / sizeof(int);

	int min = 0;
	int max = len - 1;


	int key =8;

	while (min <= max)
	{
		int middle = (min + max) / 2;

		if (arr[middle] > key)
		{
			max = middle - 1;
		}
		else if (arr[middle] == key)
		{
			printf("查找的数据为%d , 索引为 %d", arr[middle], middle);
			break;
		}
		else
		{
			min = middle + 1;
		}

	}

	if (min > max)
	{
		printf("此数据不存在");
	}
	return 0;
}

讲解指路二分查找 折半查找一个视频搞懂！_哔哩哔哩_bilibili