Binary search doesn't seem to find the element in middle.
int binary_search(int value, int values[], int n) {
int low = 0;
int high = n-1;
while( high >= low )
{
int mid = (high + low) / 2;
if ( values[mid] == value ) {
return mid;
}
if ( values[mid] > value ) {
high = mid -1;
} else if ( values[mid] < value ) {
low = mid +1;
}
}
return -1;
}
:( finds 42 in {41,42,43} \ expected an exit code of 0, not 1