StairCase.java

public class StairCase {
    public static boolean SearchStairCase(int matrix[][] , int key) {                        // O(n+m)    -- Time Complixity
        int row =0, col = matrix.length-1;
        while (row < matrix.length && col>=0) {
           if (matrix[row][col] == key) {
            System.out.println("Key Found at Index (" + row +"," + col + ")");
            return true;
           } 
           else if (key < matrix[row][col]) {
            col--;
           }
           else {
            row++;
           }
        }
        System.out.println("Key not found !");
        return false;
    }
    public static void main(String[] args) {
        int matrix[][] = {{10,20,30,40},
                          {15,25,35,45},
                          {27,29,37,48},
                          {32,33,39,50}};
        int key =33;
        SearchStairCase(matrix,key);
    }
}