二分查找

#include<stdio.h>
/*
    a[]：待查找数组
    n：数组长度
    num：待查找数字
    return 找到的数字在数组中的下标，没找到返回-1
*/
int binSearch(int a[], int n, int num)
{
    int begin = 0;
    int end = n-1;
    int mid;
    while(begin<=end)
    {
        mid = (end - begin)/2 + begin;  //  此处等价于mid = (end - begin)/2 + begin;并且可以避免加法产生的溢出
        mid = (begin + end)/2;
        if(a[mid] == num)
        {
            return mid;
        }
        else if(a[mid] > num)
        {
            end = mid - 1;
        }
        else
        {
            begin = mid + 1;
        }
    }
    printf("没找到，返回-1啊亲");
    return -1;
}
void main()
{
    int a[] = {1,3,6,9,15,21,46};
    printf("%d\n", binSearch(a, 7, 9)+1);
    printf("%d\n", binSearch(a, 7, 15)+1);
    printf("%d\n", binSearch(a, 7, 21)+1);
    printf("%d\n", binSearch(a, 7, 46)+1);
    printf("%d\n", binSearch(a, 7, 1)+1);
    printf("%d\n", binSearch(a, 7, 3)+1);
    printf("%d\n", binSearch(a, 7, 6)+1);
    printf("%d\n", binSearch(a, 7, 2)+1);
    printf("%d\n", binSearch(a, 7, 10)+1);
}