NO.9定义一个函数实现二分查找

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int abc(int a[],int n,int sz)//实现二分查找
{
	int left = 0;
	int right = sz - 1;
	int mid = (left + right) / 2;
	while (left <= right)
	{
		mid = (left + right) / 2;
		if (a[mid] < n)
			left = mid + 1;
		else if (a[mid] > n)
			right = mid - 1;
		else
			return mid;
	}
	return -1;
}
int main()
{
	int n,sz,d,mid;
	int a[] ={1,2,3,4,5,6,7,8,9};
 
	sz = sizeof(a) / sizeof(a[0]);
	scanf("%d", &n);
	d = abc(a, n, sz);
	if (d!= -1)
		printf("找到了,下标是%d\n",d);
	else
		printf("找不到\n");
	return 0;
}