二分查找的两种方法

方法一：

非函数法

#include<stdio.h>
int main()
{
	int arr[10] = { 1,2,3,4,5,6,7,8,9,10 };
	int K = 4;//3
	int sz = sizeof (arr) / sizeof (arr[0]);
	int left = 0;
	int right = sz - 1;
	while (left <= right)
	{
		int mid = (left + right) / 2;
		if (arr[mid] > K)
		{
			right = mid - 1;
		}
		else if (arr[mid] < K)
		{
			left = mid + 1;
		}
		else
		{
			printf("找到了，下标为%d", mid);
			break;
		}
	}
	if (left > right)
		printf("找不到");
	

	return 0;
}

方法二：

函数法

#include <stdio.h>
int lookfor(int arr[], int k, int sz)
{
	int left = 0;
	int right = sz - 1;
	while(left<=right)
	{
		int mid = left + (right - left) / 2;

		if (arr[mid] > k)
		{
			right = mid - 1;
		}
		else if (arr[mid] < k)
		{
			left = 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]);
	//能找到就返回下标
	//找不到返回-1
	int ret = lookfor(arr, k, sz);
	if (ret!=-1)
	{
		printf("找到了，下标是：%d\n", ret);
	}
	else
	{
		printf("没找到\n");
	}
	return 0;
}