How do you make a program to find out the saddle point in a matrix?

Answer 1

importjava.io.*;

classsaddle

{

publicstaticvoidmain(Stringargs[])throwsIOException

{

inti,k,j,c1=0,t=0,c2=0,z=0;

BufferedReader br=newBufferedReader(newInputStreamReader(System.in));

System.out.println("enter the number of rows in the matrix:");

intn=Integer.parseInt(br.readLine());

System.out.println("enter the number of columns in the matrix:");

intm=Integer.parseInt(br.readLine());

inta[][]=newint[n][m];

System.out.println("enter the elements of the matrix:");

for(i=0;i<n;i++)<span="">

{

for(j=0;j<m;j++)<span="">

a[i][j]=Integer.parseInt(br.readLine());

}

System.out.println("matrix is:");

for(i=0;i<n;i++)<span="">

{

for(j=0;j<m;j++)<span="">

System.out.print(a[i][j]+" ");

System.out.println();

}

for(i=0;i<n;i++)<span="">

{

for(j=0;j<m;j++)<span="">

{

z=a[i][j];

c1=0;

c2=0;

for(k=0;k<m;k++)<span="">

{

if(z<=a[i][k])

c1++;

}

for(k=0;k<n;k++)<span="">

{

if(z>=a[k][j])

c2++;

}

if(c1==m&&c2==n)

{

t=1;

System.out.println("saddle pt="+z);

}

}

}

if(t!=1)

System.out.println("there is no saddle point");

}

}