二分查找算法

#include<iostream>
#include<ctime>
#include<cstdlib>
#include<cstdio>

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<n; i++){
        arr[i] = arr[i-1] + rand()%5 + 1;
    }
    return arr;
}

void output(int *arr,int n){
    int len = 0;
    for(int i = 0; i<n; i++){
        len += printf("%5d",i);
    }
    printf("\n");
    for(int i=0; i<len; i++) printf("-");
    printf("\n");
    for(int i=0; i<n; i++){
        printf("%5d",arr[i]);
    }
    printf("\n");
    return;
}

int main(){
    srand(time(0));
    int n,x;
    scanf("%d",&n);
    int *arr = getRandData(10);
    output(arr,n);
    while(~scanf("%d",&x)){
        printf("arr[%d]=%d\n",binary_search(arr,10,x),x);
    }

    return 0;
}