What is wrong with this solution
#include <bits/stdc++.h>using namespace std;typedef long long int ll;ll bsearch1(ll a[], ll start, ll endi, ll tar){ll mid = (start+endi)/2;if (a[mid] == tar){return mid;}else if (a[mid] > tar){return bsearch1(a, start, mid, tar);}else{return bsearch1(a, mid, endi, tar);}}
Read more… (6 words)