In a given matrix, when most of the elements are zero then, we call it as sparse matrix. Example − 3 x3 matrix
1 1 0 0 0 2 0 0 0
In this matrix, most of the elements are zero, so it is sparse matrix.
Problem
Check whether a matrix is a sparse matrix or not.
Solution
Let us assume ZERO in the matrix is greater than (row * column)/2.
Then, the matrix is a sparse matrix otherwise not.
Program
Following is the program to check whether the given matrix is sparse matrix or not −
#include<stdio.h> #include<stdlib.h> int main(){ int row,col,i,j,a[10][10],count = 0; printf("Enter row\n"); scanf("%d",&row); printf("Enter Column\n"); scanf("%d",&col); printf("Enter Element of Matrix1\n"); for(i = 0; i < row; i++){ for(j = 0; j < col; j++){ scanf("%d",&a[i][j]); } } printf("Elements are:\n"); for(i = 0; i < row; i++){ for(j = 0; j < col; j++){ printf("%d\t",a[i][j]); } printf("\n"); } /*checking sparse of matrix*/ for(i = 0; i < row; i++){ for(j = 0; j < col; j++){ if(a[i][j] == 0) count++; } } if(count > ((row * col)/2)) printf("Matrix is a sparse matrix \n"); else printf("Matrix is not sparse matrix\n"); }
Output
When the above program is executed, it produces the following result −
Run 1: Enter row 3 Enter Column 2 Enter Element of Matrix1 1 0 2 0 2 0 Elements are: 1 0 2 0 2 0 Matrix is not sparse matrix Run 2: Enter row 3 Enter Column 2 Enter Element of Matrix1 1 0 0 0 0 0 Elements are: 1 0 0 0 0 0 Matrix is a sparse matrix