forked from AdarshaHalder/HacktoberFest--2022
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSaddle point
55 lines (55 loc) · 1.19 KB
/
Saddle point
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
import java.util.*;
class saddle {
public static void main(String[] args) {
Scanner in=new Scanner(System.in());
int n,i,j,k,max,f=0,min,c;
System.out.println("Enter Matrix Size");
n=in.newInt();
int a[][]=new int[n][n];
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
System.out.println("Enter Value");
int a[i][j]=in.newInt();
}
}
System.out.println("Matrix elements are: ");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
System.out.print(a[i][j]+"");
}
System.out.println();
}
}
for(i=0;i<n;i++)
{
min=a[1][0];
c=0;
for(j=0;j<n;j++)
{
if(a[i][j]<min)
{
min=a[i][j];
c=j;
}
}
max=a[0][c];
for(k=0;k<n;k++){
if(a[k][c]>max)
max=a[k][c];
}
if(max==min)
{
System.out.println("Saddle point number : "+max);
f=1;
}
}
if(f==0)
{
System.out.println("No saddle point number");
}
}
}