二分查找

#include <stdio.h>
#include<stdlib.h>
//回调函数，用来比较
int* compare(int* a,int* b)
{
    return *a>*b?1:0;
}
//二分查找
//思想：设两个下标，如果find>(arr[low]+arr[high])/2,则让low=mid/2+1
int binSearch(int* arr,int low,int high,int find)
{
    int mid;
    while (low<=high)
    {
        mid = (low+high)/2;
        if(arr[mid] == find)
            return mid;
        else if(find>arr[mid])
            low = mid+1;
        else
            high = mid -1;
    }
    return -1;

}
//递归版本
int binSearch_reverse(int* arr,int low,int high,int find)
{
    int mid;
    if (low<=high)
    {
        mid = (low+high)/2;
        if(arr[mid] == find)
            return  mid;
        else if(find > arr[mid])
            return  binSearch_reverse(arr,mid+1,high,find);
        else
            return  binSearch_reverse(arr,low,mid-1,find);
    }
    else {
        return  -1;
    }
}
int main()
{


    int arr[10] = {1,3,5,7,9,2,4,6,8,10};
    qsort(arr,10,sizeof(int),compare);

    for(int i = 0;i<10;i++)
    {
        printf("%d\n",arr[i]);
    }
    int a= binSearch(arr,0,9,3);
    printf("%d\n",a);
    printf("Hello World!\n");
    return 0;
}