Search a 2D Matrix

/*

Search a 2D Matrix

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

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

For example,
Consider the following matrix:

[
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]

Given target = 3, return true.

*/
class Solution {
public:
    bool searchMatrix(vector<vector<int> > &matrix, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int rowSize = matrix.size();
        if(rowSize == 0) return false;
        int colSize = matrix[0].size();
        if(colSize == 0) return false;
       
        if(target<matrix[0][0] ||  target>matrix[rowSize-1][colSize-1]) return false;
        if(target==matrix[0][0] || target==matrix[rowSize-1][colSize-1]) return true;
       
        int low = 0;
        int high = rowSize - 1;
        int mid = (low+high)/2;
        int midVal;
        if(target == matrix[mid][0]) return true;
               
        while(matrix[mid][0] != target && low <= high && mid >=0 && mid < rowSize){
          midVal = matrix[mid][0];
          if(target > midVal) low = mid+1;
          if(target == midVal) return true;
          if(target < midVal) high = mid-1;
          mid = (low+high)/2;
        }
       
        if(matrix[mid][0] == target) return true;
        int row;
        if(target>matrix[rowSize-1][0]) row = rowSize-1;
        else if(low>rowSize-1) row = high;
        else if(target>matrix[high][0] && target<matrix[low][0]) row = high;
       
        low = 0;
        high = colSize - 1;
        mid = (low+high)/2;
        if(matrix[row][mid] == target) return true;
        if(matrix[row][high] < target) return false;
       
        while(matrix[row][mid] != target && low <= high){
          midVal = matrix[row][mid];
          if(target > midVal) low = mid+1;
          if(target == midVal) return true;
          if(target < midVal) high = mid-1;
          mid = (low+high)/2;
        }
       
        if(matrix[row][mid]==target) return true;
       
        return false;
    }
};