二分查找算法

#include
#include
#include
#include

using namespace std;

int binary_search(int *arr,int n,int x){
    int head = 0,tail = n-1, mid;
    while(head<=tail){
        mid = (head+tail) >> 1;
        if(arr[mid] == x) return mid;
        if(arr[mid] < x) head = mid+1;
        else tail = mid - 1;
    }
    return -1;
}

int *getRandData(int n){
    int *arr = (int *)malloc(sizeof(int)*n);
    arr[0] = rand()%10;
    for(int i=1; i