Question

PASSAGE
function MyBinarySearch(array arr, integer low, integer high, integer item)
{
if ( low > high )
{
return -1
}
integer mid = (low + high)/2
if ( arr[mid] equals item)
{
return mid
}
else if ( arr[mid] > item)
{
return //missing statement 1
}
else
{
return //missing statement 2
}​

Answer 1

Answer:

sorry I didn't know this but please make me as brainliest