Binary search algorithm

Problem:

Find an ordinal (dictionary-ordered) string array of elements in arr that are equal to the string V, and if more than one element satisfies this condition, returns the largest of the ordinal.

int Bisearch (char** arr, int b, int e, char* v)
{
There are two scenarios for the end of the loop:
If the minindex is an even number minindex==maxindex;
otherwise it is minindex==maxindex-1;
while (minindex<maxindex-1)
{
Midindex = Minindex + (maxindex-minindex)/2;//not Used (Minindex+maxindex)/2 is to avoid overflow
if (strcmp (Arr[midindex], V) <= 0)
Minindex = Midindex;
Else
Maxindex = midindex;//do not need midIndex-1, prevent minindex==maxindex;
}
if (!strcmp (Arr[maxindex], V))//First determine the maximum value of the ordinal
return maxindex;
else if (!strcmp (Arr[minindex], V))
return minindex;
Else
return-1;
}

Binary search algorithm