-
Notifications
You must be signed in to change notification settings - Fork 32
/
Copy patharrays.c
69 lines (67 loc) · 1.33 KB
/
arrays.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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <stdio.h>
int i,j;
int main()
{
int A[3][3]={{2,1,3},{6,5,4},{8,7,9}};
int B[3][3]={{4,2,9},{1,8,3},{7,5,6}};
printf("A = \n");
for (i=0;i<3;i++){
for (j=0;j<3;j++){
printf("%d ",A[i][j]);
}
printf("\n");
}
printf("\n");
printf("B = \n");
for (i=0;i<3;i++){
for (j=0;j<3;j++){
printf("%d ",B[i][j]);
}
printf("\n");
}
printf("\n");
sumOfAB(A,B);
maxInA(A);
sumOfRow(B);
}
int sumOfAB(int a[3][3],int b[3][3]){
printf("C = \n");
int C[3][3];
for(i=0;i<3;i++){
for(j=0;j<3;j++){
C[i][j]=a[i][j]+b[i][j];
printf("%2d ",C[i][j]);
}
printf("\n");
}
printf("\n");
return 0;
}
int maxInA(int a[3][3]){
printf("The maximum value of array A = ");
int check[1];
for(i=0;i<3;i++){
for(j=0;j<2;j++){
if (a[i][j]>a[i][j+1]){
check[0]=a[i][j];
}else{
check[0]=a[i][j+1];
}
}
}
printf("%d\n\n",check[0]);
return 0;
}
int sumOfRow(int b[3][3]){
int sum;
int raw=0;
for(i=0;i<3;i++){
sum=0;
for(j=0;j<3;j++){
sum+=b[i][j];
}
raw+=1;
printf("Sum of raw %d : %d\n",raw,sum);
}
return 0;
}