创建函数能够对整型数组进行二分查找。

#include<stdio.h>
int Find(int a[],int x,int sz)
{
    int left = 0;
    int right = sz;
    while(left<=right) 
        {
            int mid = (left+right)/2;
            if(a[mid]>x)
                {

                     right = mid - 1;
                }

            else if(a[mid]<x)
                {
                    left = mid + 1;
                }
                else 
                    {
                        printf("找到了，在第%d个。\n",mid+1);
						break;
                    } 
	        }
	if(left>right)
                   {
                       printf("找不到.\n");
                   }
    return 0;
}
int main()
{
	int i,n;
	int arr[10] = {1,2,3,4,5,6,7,8,9,10};
	printf("请输入要查找的数:");
	scanf("%d",&n);
	Find(arr,n,10);
	return 0;
}