-
Notifications
You must be signed in to change notification settings - Fork 0
/
StaircaseSearch.java
38 lines (29 loc) · 1.04 KB
/
StaircaseSearch.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
// searching the key element in the 2D array in the efficient way with the less time complaxity
import java.util.*;
public class StaircaseSearch {
public static boolean search(int matrix[][],int key) {
int row = 0;
int col = matrix[0].length - 1;
while (row < matrix.length && col >= 0) {
if (key == matrix[row][col]) {
System.out.println("The Key value is found at (" + row + "," + col + ")");
return true;
}
else if (key < matrix[row][col]) {
col--;
}
else if (key > matrix[row][col]) {
row++;
}
}
System.out.println("the key is not found ");
return false;
}
public static void main(String[] args) {
int array[][]={{10,20,30,40},
{15,25,35,45,},
{27,29,37,48},
{32,33,39,50}};
search(array,33);
}
}