Saddle Point Matrix In Java ISC
Program to find the SADDLE POINT for the matrix.
class Saddlepoint{
//start of class
public void accept(int a[][]){
int n=0;
int r=a.length;
int c=a[0].length;
for(int i=0;i<r;i++){
int min=a[i][0];
int p=0;
for(int j=0;j<c;j++){
if(a[i][j]<min){
min=a[i][j];
p=j;
}}
int max=a[0][p];
for(int k=0;k<r;k++){
if(a[k][p]>max){
max=a[k][p];
n=k;
}}
if(n==i){
System.out.println("The Saddle point "+a[i][p]);
break;
}}
}}//end of class
OUTPUT---WHEN INPUT IS {{1,2,2},{2,3,5}}
The Saddle point 2
class Saddlepoint{
//start of class
public void accept(int a[][]){
int n=0;
int r=a.length;
int c=a[0].length;
for(int i=0;i<r;i++){
int min=a[i][0];
int p=0;
for(int j=0;j<c;j++){
if(a[i][j]<min){
min=a[i][j];
p=j;
}}
int max=a[0][p];
for(int k=0;k<r;k++){
if(a[k][p]>max){
max=a[k][p];
n=k;
}}
if(n==i){
System.out.println("The Saddle point "+a[i][p]);
break;
}}
}}//end of class
OUTPUT---WHEN INPUT IS {{1,2,2},{2,3,5}}
The Saddle point 2
Comments
Post a Comment