long binsearch(long all[],long n,int max_friends)
{
int low = 0,high = n-1,mid;
if(all[low] == max_friends)
return low;
if(all[high] == max_friends)
return high;
while(low <= high)
{
mid = low+((high-low)/2);
if(all[mid] == max_friends)
return mid;
if(all[mid] > max_friends)
high = mid-1;
else
low = mid+1;
}
if(low>high)
return -1;
}
{
int low = 0,high = n-1,mid;
if(all[low] == max_friends)
return low;
if(all[high] == max_friends)
return high;
while(low <= high)
{
mid = low+((high-low)/2);
if(all[mid] == max_friends)
return mid;
if(all[mid] > max_friends)
high = mid-1;
else
low = mid+1;
}
if(low>high)
return -1;
}