74-Search-A-2D-Matrix.java is not a Binary Search

[AmonKip]

The Java solution is a linear search and NOT a binary search. Worst case runtime for the code is O(m+n) which occurs if the target value is at the bottom left corner of the matrix. Binary search solution should be O(logm) + O(logn) as described in the video solution.

[Ahmad-A0]

I think 74-Search-A-2D-Matrix.java is the solution in question

class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        int i = 0;
        int j = matrix[0].length - 1;
        while(i >= 0 && i <= matrix.length - 1 && j >= 0 && j <= matrix[0].length - 1){
            if(matrix[i][j] == target){
                return true;
            } else if (matrix[i][j] > target){
                j--;
            } else {
                i++;
            }
        }
        return false;
    }
}

If anyone knows java and would like to submit a pull request to fix this please go ahead. I think this is also #424

[AmonKip]

Yes it's leetcode problem #74. Sorry, I was specific enough.