This is the java program to find out a given matrix is sparse matrix or not. Sparse matrix contains zero elements above a certain threshold. This threshold is given by (n*m)/2, where n and m are the rows and columns in matrix. Hence, if a matrix contains more than nm/2 mumber of zeros it is sparse matrix otherwise not.
Here is the source code of the Java Program to Check if it is a Sparse Matrix. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a sample program to check whether the matrix is sparse matrix or not
//The complexity of the code is O(n^2)
import java.util.Scanner;
public class Sparsity_Matrix
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter the dimensions of the matrix: ");
int m = sc.nextInt();
int n = sc.nextInt();
double[][] mat = new double[m][n];
int zeros = 0;
System.out.println("Enter the elements of the matrix: ");
for(int i=0; i<m; i++)
{
for(int j=0; j<n; j++)
{
mat[i][j] = sc.nextDouble();
if(mat[i][j] == 0)
{
zeros++;
}
}
}
if(zeros > (m*n)/2)
{
System.out.println("The matrix is a sparse matrix");
}
else
{
System.out.println("The matrix is not a sparse matrix");
}
sc.close();
}
}
Output:
$ javac Sparsity_matrix.java $ java Sparsity_matrix Enter the dimensions of the matrix: 2 3 Enter the elements of the matrix: 1 0 0 2 1 1 The matrix is not a sparse matrix $ javac Sparsity_matrix.java $ java Sparsity_matrix Enter the dimensions of the matrix: 3 4 Enter the elements of the matrix: 1 0 0 0 0 1 0 0 0 0 1 1 The matrix is a sparse matrix
Related posts:
Java Program to Implement Meldable Heap
Java Program to Check Cycle in a Graph using Graph traversal
So sánh HashSet, LinkedHashSet và TreeSet trong Java
Concurrent Test Execution in Spring 5
The StackOverflowError in Java
Practical Java Examples of the Big O Notation
Checked and Unchecked Exceptions in Java
Check if there is mail waiting
Các chương trình minh họa sử dụng Cấu trúc điều khiển trong Java
Java Program to Check Whether it is Weakly Connected or Strongly Connected for a Directed Graph
Java Program to Represent Graph Using 2D Arrays
Java Program to Implement Binary Heap
Java Program to Implement the Bin Packing Algorithm
How to Count Duplicate Elements in Arraylist
Guide to BufferedReader
Validate email address exists or not by Java Code
Java – Reader to Byte Array
Java Program to Implement Splay Tree
Java Program to Implement the Monoalphabetic Cypher
Recommended Package Structure of a Spring Boot Project
Java Program to Implement Hopcroft Algorithm
Java Program to Implement Sparse Array
Java Program to Implement Hash Tables
How to Read HTTP Headers in Spring REST Controllers
Spring Data Reactive Repositories with MongoDB
A Custom Media Type for a Spring REST API
Simplify the DAO with Spring and Java Generics
Java Program to Find All Pairs Shortest Path
Java Program to Apply DFS to Perform the Topological Sorting of a Directed Acyclic Graph
Java Program to Create a Minimal Set of All Edges Whose Addition will Convert it to a Strongly Conne...
Java Program to Perform Searching in a 2-Dimension K-D Tree
Java Program to Implement Hash Trie