Improve binarySearch tests

[skiadas]

For instance code like this should fail timing test:

  if (arr[mid] > val) {
     hi=mid;
     mid=Math.floor(hi/2);
  }