Searching Algorithms (linear search, binary search)

What searching strategy is used for this 2D sorted matrix?

function searchMatrix(matrix, target) {
  if(!matrix.length || !matrix[0].length) return false;
  
  let row = 0;
  let col = matrix[0].length - 1;
  
  while(row < matrix.length && col >= 0) {
    if(matrix[row][col] === target) return true;
    if(matrix[row][col] > target) col--;
    else row++;
  }
  return false;
}

Row-wise binary search
Column-wise binary search
Staircase search
This implements staircase search because: 1) Starts from top-right corner, 2) Moves left if current > target, 3) Moves down if current < target, 4) Eliminates portions of matrix efficiently, 5) O(m + n) time complexity, 6) No need for nested searches, 7) Works on row and column sorted matrices, 8) More efficient than searching each row.
Diagonal search

Next Question (23/24)