C++ Program to check if matrix is lower triangular
Last Updated :
10 Jun, 2022
Given a square matrix and the task is to check the matrix is in lower triangular form or not. A square matrix is called lower triangular if all the entries above the main diagonal are zero.
Examples:
Input : mat[4][4] = {{1, 0, 0, 0},
{1, 4, 0, 0},
{4, 6, 2, 0},
{0, 4, 7, 6}};
Output : Matrix is in lower triangular form.
Input : mat[4][4] = {{1, 0, 0, 0},
{4, 3, 0, 1},
{7, 9, 2, 0},
{8, 5, 3, 6}};
Output : Matrix is not in lower triangular form.
C++
#include <bits/stdc++.h>
#define N 4
using namespace std;
bool isLowerTriangularMatrix( int mat[N][N])
{
for ( int i = 0; i < N; i++)
for ( int j = i + 1; j < N; j++)
if (mat[i][j] != 0)
return false ;
return true ;
}
int main()
{
int mat[N][N] = { { 1, 0, 0, 0 },
{ 1, 4, 0, 0 },
{ 4, 6, 2, 0 },
{ 0, 4, 7, 6 } };
if (isLowerTriangularMatrix(mat))
cout << "Yes" ;
else
cout << "No" ;
return 0;
}
|
Output:
Yes
Time Complexity: O(n2), where n represents the number of rows and columns of the matrix.
Auxiliary Space: O(1), no extra space is required, so it is a constant.
Please refer complete article on Program to check if matrix is lower triangular for more details!
Share your thoughts in the comments
Please Login to comment...