know about saddle point in a matrix : http://en.wikipedia.org/wiki/Saddle_point
#include <stdio.h>
main()
{
int i,j,k,n,min,max,a[20][20],p[10][10];
printf("Enter the order\t");
scanf("%d",&n);
printf("Enter the elements\t");
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
printf("Matrix is\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
printf("%d\t",a[i][j]);
printf("\n");
}
for(i=0;i<n;i++)
{
min=a[i][0];
for(j=0;j<n;j++)
{
if(min>=a[i][j])
{
min=a[i][j];
p[0][0]=i;
p[0][1]=j;
}
}
j=p[0][1];
max=a[0][j];
for(k=0;k<n;k++)
{
if(max<=a[k][j])
{
max=a[i][j];
p[1][0]=k;
p[1][1]=j;
}
}
if(min==max)
{
if(p[0][0]==p[1][0]&&p[0][1]==p[1][1])
printf("Saddle point is %d at the position (%d,%d)\n",max,p[0][0],p[0][1]);
}
}
}
![]() |
| output |

No comments:
Post a Comment