Skip to content

Commit

Permalink
Print Upper Triangular Matrix
Browse files Browse the repository at this point in the history
  • Loading branch information
Manishak798 authored Mar 12, 2024
1 parent 14d9442 commit dd080ca
Showing 1 changed file with 95 additions and 0 deletions.
95 changes: 95 additions & 0 deletions Matrix_Questions/UpperTriangularMatrix.Cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,95 @@
/**
* @file UpperTriangularMatrix.Cpp
* @author your name ([email protected])
* @brief
* @version 0.1
* @date 2024-03-12
*
* @copyright Copyright (c) 2024
*Write a program in C to print or display an upper triangular matrix.
Test Data :
Input the size of the square matrix : 3
Input elements in the first matrix :
element - [0],[0] : 1
element - [0],[1] : 2
element - [0],[2] : 3
element - [1],[0] : 4
element - [1],[1] : 5
element - [1],[2] : 6
element - [2],[0] : 7
element - [2],[1] : 8
element - [2],[2] : 9
Expected Output :
The matrix is :
1 2 3
4 5 6
7 8 9
Setting zero in upper triangular matrix
1 0 0
4 5 0
7 8 9
*/
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cout << "Enter size of Matrix: ";
cin >> n;
int arr[n][n];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
cout << "Enter element of array at " << i << " " << j << " : ";
cin >> arr[i][j];
}
cout << endl;
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (j > i)
{
arr[i][j] = 0;
}
}
}
cout << endl;
cout << "Upper Triangular Matrix : [ " << endl;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
cout << arr[i][j];
}
cout << endl;
}
cout << "]";
}
/**
* @brief
* Enter size of Matrix: 3
Enter element of array at 0 0 : 1
Enter element of array at 0 1 : 2
Enter element of array at 0 2 : 3
Enter element of array at 1 0 : 4
Enter element of array at 1 1 : 5
Enter element of array at 1 2 : 6
Enter element of array at 2 0 : 7
Enter element of array at 2 1 : 8
Enter element of array at 2 2 : 9
Upper Triangular Matrix : [
100
450
789
]
*
*/

0 comments on commit dd080ca

Please sign in to comment.