-
Notifications
You must be signed in to change notification settings - Fork 1k
/
Copy pathmatrix_addition.cpp
75 lines (68 loc) · 1.89 KB
/
matrix_addition.cpp
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
// C++ program to implement Matrix Addition
#include <bits/stdc++.h>
using namespace std;
void matrix_add(int [][10],int [][10],int [][10],int,int,int,int);
int main()
{
int r1, c1, r2, c2;
cout << "Enter the number of rows and columns of the first matrix: ";
cin >> r1 >> c1;
cout << "Enter the number of rows and columns of the second matrix: ";
cin >> r2 >> c2;
//If the given matrices differ in thier number of rows and columns, they cannot be added
if ((r1 != r2) || (c1 != c2))
{
cout << "Given Matrices cannot be added!!!";
return 0;
}
int A[10][10], B[10][10], C[10][10];
// Input the values of the matrices
cout << "Enter the values of the first matrix\n";
for (int i = 0; i < r1; i++)
{
for (int j = 0; j < c1; j++)
cin >> A[i][j];
}
cout << "Enter the values of the second matrix\n";
for (int i = 0; i < r2; i++)
{
for (int j = 0; j < c2; j++)
cin >> B[i][j];
}
matrix_add(C,A,B,r1,r2,c1,c2);
cout << "The resultant matrix is:\n";
for (int i = 0; i < r2; i++)
{
for (int j = 0; j < c2; j++)
cout << C[i][j] << " ";
cout << endl;
}
return 0;
}
void matrix_add(int C[][10],int A[][10],int B[][10],int r1,int r2,int c1,int c2)
{
for (int i = 0; i < r1; i++)
{
for (int j = 0; j < c2; j++)
{
// Add the corresponding values of both the matrices
C[i][j] = A[i][j] + B[i][j];
}
}
}
/*
Time Complexity: O(r * c), where 'r' is the number of rows and 'c' is the number of columns
Space Complexity: O(r * c)
SAMPLE INPUT AND OUTPUT
Enter the number of rows and columns of the first matrix: 2 2
Enter the number of rows and columns of the second matrix: 2 2
Enter the values of the first matrix
2 2
2 2
Enter the values of the second matrix
2 2
2 2
The resultant matrix is:
4 4
4 4
*/