Merge pull request #90 from TheAlgorithms/changed_sparse_matrix

fixed bugs and improved the code

Others/Sparse matrix.cpp

@@ -1,27 +1,40 @@
 /*A sparse matrix is a matrix which has number of zeroes greater than (m*n)/2,
 where m and n are the dimensions of the matrix.*/
 #include <iostream>
+using namespace std;
+
 int main()
 {
-  int m,n,i,j,c=0;
-  cout << "Enter dimensions of matrix:";
+  int m,n;
+  int counterZeros=0;
+  cout << "Enter dimensions of matrix (seperated with space): ";
   cin >> m >> n;
   int a[m][n];
   cout << "Enter matrix elements:";
-  for(i=0;<m;i++)
+  cout << "\n";
+
+  // reads the matrix from stdin
+  for(int i=0;i<m;i++)
   {
-    for(j=0;j<n;j++)
-     cin >> a[i][j];
-  }
-  for(i=0;i<m;i++)
-  {
-    for(j=0;j<n;j++)
+    for(int j=0;j<n;j++)
     {
-      if(a[i][j]==0)
-       c++; //Counting number of zeroes
+        cout << "element? ";
+        cin >> a[i][j];
     }
   }
-  if(c>((m*n)/2)) //Checking for sparse matrix
+
+  // counts the zero's
+  for(int i=0;i<m;i++)
+  {
+    for(int j=0;j<n;j++)
+    {
+      if(a[i][j]==0)
+       counterZeros++; //Counting number of zeroes
+    }
+  }
+
+  // makes sure the matrix is a sparse matrix
+  if(counterZeros>((m*n)/2)) //Checking for sparse matrix
    cout << "Sparse matrix";
   else
    cout << "Not a sparse matrix";