1
function binarySearch(arr, target) {
2
  let low = 0;
3
  let high = arr.length - 1;
4

5
  while (low <= high) {
6
    let mid = parseInt((low + high) / 2);
7

8
    if (arr[mid] == target) {
9
      return mid;
10
    } else if (arr[mid] < target) {
11
      low = mid + 1;
12
    } else if (arr[mid] > target) {
13
      high = mid - 1;
14
    }
15
  }
16
  return -1;
17
}
18

19
var searchMatrix = function (matrix, target) {
20
  for (let i = 0; i < matrix.length; i++) {
21
    let check = binarySearch(matrix[i], target);
22

23
    if (check != -1) {
24
      return true;
25
    }
26
  }
27
  return false;
28
};