-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQues-18.cpp
37 lines (37 loc) · 962 Bytes
/
Ques-18.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
/*
QUESTION-18:
Write a program to implement Diagonal Matrix using one-dimensional array.
SOLUTION:
*/
#include <iostream>
using namespace std;
int main()
{
cout << "\n\t ~~~~~~~~~~~~~~~~~~~~~~~Practical 18~~~~~~~~~~~~~~~~~~~~\n\t\t\t\t \n";
//Take a Diagonal Matrix
int diagonal_Matrix[3][3] = {{5,0,0},{0,6,0},{0,0,2}};
int i, j, compact_Form[3];
for(i=0;i<3;i++){
for(j=0;j<3;j++){
if(i == j){
compact_Form[i] = diagonal_Matrix[i][j]; //copy diagonal elements...
}
}
}
cout << endl << "In Diagonal Form " << endl;
for(i=0;i<3;i++){
cout << compact_Form[i] << " ";
}
//To Display Results Back ...
cout << endl << "Displaying the Original Matrix" << endl;
for(i=0;i<3;i++){
cout << endl;
for(j=0;j<3;j++){
if(i == j){ // If the index is same like 00 11 22 ...
cout << compact_Form[i] << " ";
}else{
cout << "0 ";
}
}
}
}