Given a matrix where each row and column is sorted in ascending order, write a function to search for a target value in O(m + n) time. Explain why binary search on each row isn't optimal here.

Question

Answer

Stay specific. One example, told well, beats three told fast. Make your decisions visible — what you chose between. End on what changed, for whom.

Given a matrix where each row and column is sorted in ascending order, write a function to search for a target value in O(m + n) time. Explain why binary search on each row isn't optimal here.

Practice more