Sparse matrix in data structure.

 sparse matrices and their representation

 

Relatively high proportion of element of zero element entire and number of rows and column are equal so that type of  matrices is known as sparse matrices. It is also known as n^2 matrices. 

 

 

classification of sparse matrices:

sparse matrix are depend upon the entry non-zero element

1) Triangular sparse:-    triangular sparse are divided into two type–
    i) Lower triangular sparse matrix.
    ii)Upper triangular  sparse matrix.
 
2)Tridiagonal sparse matrix. 
 
i) Lower Triangular matrices:—
                                             In this  matrices entries of the non-zero element in the lower part of the matrix.
 
 
 

 

 
 
ii) Upper Triangular matrices:– 
                                            In this matrices entries of non zero element in the upper part of the matrix.
 
 
 

 

 
 
 
2) Tridiagonal Sparse matrices:–
                                              In this type of matrices entries of non zero element in the main diagonal of the matrix.
 

 

Sparse matrix in data structure:-
 

 

sparse matrix in python,sparse matrix in java,sparse matrix in c,sparse matrix in data structure,sparse matrix representation,sparse matrix example,sparse matrix have,sparse matrix in python,sparse matrix in java,sparse matrix in c,sparse matrix in data structure,sparse matrix in c++,sparse matrix representation

 

 

 

Recommended Post:

Full C course:-    

Key points:-

Cracking the coding interview:-

 Array and string:-

Tree and graph:-

Hackerearth Problems:-

Hackerrank Problems:-

Data structure:-

 MCQs:-

 

Leave a Reply

Your email address will not be published.