C++ || Short and Fast || Binary Search
```\nclass Solution {\npublic:\n    bool searchMatrix(vector>& matrix, int target) {\n        \n        int rows=matrix.size();\n        \n        int i=0;     
```\nclass Solution {\npublic:\n    bool searchMatrix(vector<vector<int>>& matrix, int target) {\n        \n        int rows=matrix.size();\n        \n        int i=0;      //1st row\n        int j=matrix[0].size()-1;  //last column\n        \n        if(matrix[0][0]==target)\n            return true;\n        \n        while(j>=0 and i<rows) {\n            if(matrix[i][j]==target)\n                    return true;\n                \n            target<matrix[i][j] ? j-- : i++;\n        }\n        return false;\n    }\n};\n\nif(foundHelpful)\n\tupVote();
['C', 'C++']