-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathPerforming_All_Operations_on_Matrix .c
114 lines (112 loc) · 2.93 KB
/
Performing_All_Operations_on_Matrix .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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include <stdio.h>
int main()
{
int i, j, s1 = 0, s2 = 0, s3 = 0, s4 = 0, order, a[10][10], b[10][10], c[10][10], d[10][10], e[10][10];
printf("\n Enter The Order of Matrix: \n");
scanf("%d", &order);
printf("\n Enter The Elements of Matrix of Order %d X %d : \n", order, order);
for (i = 0; i < order; i++)
{
for (j = 0; j < order; j++)
{
scanf("%d", &a[i][j]);
}
printf("\n");
}
printf("-----------------------------------------------");
printf("\n Principal Diagonal Elements Are :\n");
for (i = 0; i < order; i++)
{
for (j = 0; j < order; j++)
{
if (i == j)
{
c[i][j] = a[i][j];
}
else
c[i][j] = 0;
}
}
for (i = 0; i < order; i++)
{
for (j = 0; j < order; j++)
{
printf("%d ", c[i][j]);
s1 = s1 + c[i][j];
}
printf("\n");
}
printf("\n Sum of Principal Diagonal Elements is: %d\n\n", s1);
printf("----------------------------------------------\n");
printf("\n Non-Principal Diagonal Elements are: \n");
for (i = 0; i < order; i++)
{
for (j = 0; j < order; j++)
{
if (i + j == order - 1)
{
d[i][j] = a[i][j];
}
else
d[i][j] = 0;
}
}
for (i = 0; i < order; i++)
{
for (j = 0; j < order; j++)
{
printf("%d ", d[i][j]);
s2 = s2 + d[i][j];
}
printf("\n");
}
printf("\n Sum of Non-Principal Diagonal Elements is: %d\n\n", s2);
printf("----------------------------------------------\n");
for (i = 0; i < order; i++)
{
for (j = 0; j < order; j++)
{
if (i < j)
{
b[i][j] = a[i][j];
}
else
b[i][j] = 0;
}
}
printf("\n Upper Triangular Matrix is: \n");
for (i = 0; i < order; i++)
{
for (j = 0; j < order; j++)
{
printf("%d ", b[i][j]);
s3 = s3 + b[i][j];
}
printf("\n");
}
printf("\n Sum of Upper Triangular Matrix is: %d ", s3);
printf("\n----------------------------------------------\n");
for (i = 0; i < order; i++)
{
for (j = 0; j < order; j++)
{
if (i > j)
{
e[i][j] = a[i][j];
}
else
e[i][j] = 0;
}
}
printf("\n Lower Triangular Matrix is: \n");
for (i = 0; i < order; i++)
{
for (j = 0; j < order; j++)
{
printf("%d ", e[i][j]);
s4 = s4 + e[i][j];
}
printf("\n");
}
printf("\n Sum of Lower Triangular Matrix is: %d ", s4);
}