Skip to content

Instantly share code, notes, and snippets.

@gokhanyavas
Created May 16, 2013 05:49
Show Gist options
  • Save gokhanyavas/5589644 to your computer and use it in GitHub Desktop.
Save gokhanyavas/5589644 to your computer and use it in GitHub Desktop.
N x M boyutlu matristeki en büyük elemanı ve bu elemanın satır ve sütün adresini bulan C programı.
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
int main()
{
int i,j,n,m;
int sat,sut,enb;
int mat[10][10];
printf("Satir sayisi : ");
scanf("%d",&n);
printf("Sutun sayisi : ");
scanf("%d",&m);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
printf("%d . satir , %d sutun elemani : ", i,j);
scanf("%d",&mat[i][j]);
}
enb = mat[1][1];
sat = 1;
sut = 1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
if(enb < mat[i][j])
{
enb = mat[i][j];
sat=i;
sut=j;
}
}
printf("En buyuk sayi : %d\n", enb);
printf("Satir : %d\n ",sat);
printf("Sutun : %d\n ",sut);
getch();
}
@volkancicek20
Copy link

#include <stdio.h>
#include <stdlib.h>
int main() {
int n,m,i,j;
printf("nxm elemanli bir matris belirleyin\n");
printf("n:");
scanf("%d",&n);
printf("m:");
scanf("%d",&m);
int matris[n][m];
printf("*******************\n");
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
printf("eleman[%d][%d]:",i+1,j+1);
scanf("%d",&matris[i][j]);
}
}
int enbuyuk=matris[0][0];
int satir,sutun;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
if(matris[i][j]>enbuyuk)
{
enbuyuk=matris[i][j];
satir=i+1;
sutun=j+1;
}
}
}
printf("matrisin en buyuk elemani %d- %d. satirin %d. sutunu",enbuyuk,satir,sutun);
return 0;
}

@aabdurrahmanevi
Copy link

#include <stdio.h>
#include <string.h>

int main ()
{
int matris[3][4],i,j ,enb=0,a,b;

for(i = 0; i < 3; i++)
{
	for(j=0; j<4; j++)
	{
		printf("Lutfen %d. sutunun %d. satirini giriniz: ",i,j);
		scanf("%d",&matris[i][j]);
		if(matris[i][j]>enb)
		{
			enb = matris[i][j];
			a =i ;
			b=j;
			
		}
		
		
		
	}
}

printf("Girdiginiz en buyuk sayi %d dir ve onun satýr ve sutundaki yeri matris[%d][%d]",enb,a,b);


return 0;

}

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment