Binsearch(TODO)

#include <iostream>
#include <stdio.h>

using namespace std;

int binsearch(int* array, int x, int right, int left = 0){
    int middle = (left + right) / 2;
    if (*(array + middle) == x) return middle;
    if (middle == left || middle == right) return -1;
    if (*(array + middle) < x) binsearch(array, x, right, middle); else binsearch(array, x, middle);
    }

int main(){
    int arr [7] = {1, 2, 3, 4, 5, 6, 7};
    int * arr_ptr = &arr;
    cout << binsearch(*arr_ptr, 2, 7)
    return 0;
}