-
Notifications
You must be signed in to change notification settings - Fork 15
/
Copy path11.c
32 lines (27 loc) · 761 Bytes
/
11.c
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
#include <stdio.h>
int find_largest(int *matrix, int rows, int cols) {
int i, j, largest = *matrix;
for (i = 0; i < rows; i++) {
for (j = 0; j < cols; j++) {
if (*(matrix + i * cols + j) > largest) {
largest = *(matrix + i * cols + j);
}
}
}
return largest;
}
int main() {
int m, n, i, j;
printf("Enter number of rows and columns: ");
scanf("%d %d", &m, &n);
int matrix[m][n];
printf("Enter matrix elements: \n");
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &matrix[i][j]);
}
}
int largest = find_largest(&matrix[0][0], m, n);
printf("Largest element in the matrix is %d\n", largest);
return 0;
}