# Program to check whether a two dimensional array is a Sparse Matrix

A Sparse Matrix is a matrix(two-dimensional array) in which number of 0's is greater than the number of non-zero elements.

Below is a program to check whether a matrix is sparse or not.

``````#include<stdio.h>

int main()
{
printf("\n\n\t\tStudytonight - Best place to learn\n\n\n");
int n, m, c, d, matrix;
int counter = 0;
printf("\nEnter the number of rows and columns of the matrix \n\n");
scanf("%d%d",&m,&n);

printf("\nEnter the %d elements of the matrix \n\n", m*n);
for(c = 0; c < m; c++)   // to iterate the rows
{
for(d = 0; d < n; d++)   // to iterate the columns
{
scanf("%d", &matrix[c][d]);
if(matrix[c][d] == 0)
counter++;  // same as counter=counter +1
}
}

// printing the matrix
printf("\n\nThe entered matrix is: \n\n");
for(c = 0; c < m; c++)   // to iterate the rows
{
for(d = 0; d < n; d++)   // to iterate the columns
{
printf("%d\t", matrix[c][d]);
}
printf("\n"); // to take the control to the next row
}

// checking if the matrix is sparse or not
if(counter > (m*n)/2)
printf("\n\nThe entered matrix is a sparse matrix\n\n");
else
printf("\n\nThe entered matrix is not a sparse matrix\n\n");

printf("\n\n\t\t\tCoding is Fun !\n\n\n");
return 0;
}``````