Sparse Matrix (Introduction)
September 15, 2016
Categorised in: Data Structures & Algorithms
A Sparse Matrix is a special type of matrix in which maximum number of Elements are “Zero Elements” or In other words, A Matrix containing least number of “Non-Zero Elements”. The concept of Sparse Matrix is very useful in Data Structures and Algorithms which helps reduce Time Complexity of the functionality of the code as compared to the traditional way of performing operations on a Matrix.
Sparse Matrix
Pratik Kataria is currently learning Springboot and Hibernate.
Technologies known and worked on: C/C++, Java, Python, JavaScript, HTML, CSS, WordPress, Angular, Ionic, MongoDB, SQL and Android.
Softwares known and worked on: Adobe Photoshop, Adobe Illustrator and Adobe After Effects.