Search a 2D Matrix

Write an efficient algorithm that searches for a target value in an m x n matrix. This matrix has the following properties:

1)Integers in each row are sorted from left to right. 2)The first integer of each row is greater than the last integer of the previous row.

You are given a target value to search for. If the target value is found in the matrix, return true; otherwise, return false.