二分查找（解决大多数查找问题模板）

#include<stdio.h>
int binarysearch(int x[],int num,int find)
{
	int left=-1,right=num,mid;
	while(left+1!=right)
	{
		mid=(left+right)/2;
		if(x[mid]<find)
		left=mid;
		else
		right=mid;
	}
	if(x[right]==find)
	return right+1;
	else
	return -1;
}
main()
{
	int num,times,i,find,ans;
	scanf("%d%d",&num,&times);
	int x[num+2];
	for(i=0;i<num;i++)
	{
		scanf("%d",&x[i]);
	}
	for(i=1;i<=times;i++)
	{
		scanf("%d",&find);
		ans=binarysearch(x,num,find);
		printf("%d ",ans);
	}
}

https://www.bilibili.com/video/BV1d54y1q7k7?spm_id_from=333.337.search-card.all.click