-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFindNumberInMatrix.java
More file actions
79 lines (71 loc) · 1.07 KB
/
FindNumberInMatrix.java
File metadata and controls
79 lines (71 loc) · 1.07 KB
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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
package onlinequestions;
public class FindNumberInMatrix {
static int[][] arr = new int[10][10];
private static int comparisions=0;
public static void main(String[] args)
{
int start=0;
for(int i=0; i<10; i++)
{
start+=5;
for(int j=0; j<10; j++)
{
arr[i][j]= start;
start+=5;
}
}
FindNumberInMatrix.printArray();
FindNumberInMatrix.find(505);
}
static void printArray()
{
for(int i=0; i<10; i++)
{
for(int j=0; j<10; j++)
{
System.out.print(arr[i][j] + " ");
}
System.out.println("");
}
}
static void find(int n)
{
int i=0;
int j=9;
boolean found=false;
int corner = arr[i][j];
while(i<10 && j>=0)
{
if(corner == n)
{
System.out.println("Element found!!!");
comparisions++;
System.out.println("Number of comparisions : " + comparisions);
found=true;
break;
}
else if(corner<n)
{
i++;
if(i<10)
{
corner=arr[i][j];
comparisions++;
}
}
else if(corner>n)
{
j--;
if(j>=0)
{
corner=arr[i][j];
comparisions++;
}
}
}
if(!found)
{
System.out.println("Not found!!");
}
}
}