Refactor files to be in correctly nested packages (#6120)

pmd-exclude.properties

@@ -55,7 +55,6 @@ com.thealgorithms.maths.SumOfArithmeticSeries=UselessParentheses
 com.thealgorithms.maths.TrinomialTriangle=UselessParentheses
 com.thealgorithms.maths.VampireNumber=CollapsibleIfStatements
 com.thealgorithms.maths.Volume=UselessParentheses
-com.thealgorithms.matrixexponentiation.Fibonacci=UnnecessaryFullyQualifiedName
 com.thealgorithms.misc.Sparsity=UselessParentheses
 com.thealgorithms.misc.ThreeSumProblem=UselessParentheses
 com.thealgorithms.misc.WordBoggle=UselessParentheses

src/main/java/com/thealgorithms/matrix/InverseOfMatrix.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.matrix;
 
 /**
  * This class provides methods to compute the inverse of a square matrix

src/main/java/com/thealgorithms/matrix/MatrixTranspose.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.matrix;
 
 /**
  *

src/main/java/com/thealgorithms/matrix/MedianOfMatrix.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.matrix;
 
 import java.util.ArrayList;
 import java.util.Collections;

src/main/java/com/thealgorithms/matrix/MirrorOfMatrix.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.matrix;
 
 // Problem Statement
 /*

src/main/java/com/thealgorithms/matrix/PrintAMatrixInSpiralOrder.java

@@ -1,62 +1,62 @@
-package com.thealgorithms.others;
-
-import java.util.ArrayList;
-import java.util.List;
-
-public class PrintAMatrixInSpiralOrder {
-    /**
-     * Search a key in row and column wise sorted matrix
-     *
-     * @param matrix matrix to be searched
-     * @param row    number of rows matrix has
-     * @param col    number of columns matrix has
-     * @author Sadiul Hakim : https://github.com/sadiul-hakim
-     */
-
-    public List<Integer> print(int[][] matrix, int row, int col) {
-
-        // r traverses matrix row wise from first
-        int r = 0;
-        // c traverses matrix column wise from first
-        int c = 0;
-        int i;
-
-        List<Integer> result = new ArrayList<>();
-
-        while (r < row && c < col) {
-            // print first row of matrix
-            for (i = c; i < col; i++) {
-                result.add(matrix[r][i]);
-            }
-
-            // increase r by one because first row printed
-            r++;
-
-            // print last column
-            for (i = r; i < row; i++) {
-                result.add(matrix[i][col - 1]);
-            }
-
-            // decrease col by one because last column has been printed
-            col--;
-
-            // print rows from last except printed elements
-            if (r < row) {
-                for (i = col - 1; i >= c; i--) {
-                    result.add(matrix[row - 1][i]);
-                }
-
-                row--;
-            }
-
-            // print columns from first except printed elements
-            if (c < col) {
-                for (i = row - 1; i >= r; i--) {
-                    result.add(matrix[i][c]);
-                }
-                c++;
-            }
-        }
-        return result;
-    }
-}
+package com.thealgorithms.matrix;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class PrintAMatrixInSpiralOrder {
+    /**
+     * Search a key in row and column wise sorted matrix
+     *
+     * @param matrix matrix to be searched
+     * @param row    number of rows matrix has
+     * @param col    number of columns matrix has
+     * @author Sadiul Hakim : https://github.com/sadiul-hakim
+     */
+
+    public List<Integer> print(int[][] matrix, int row, int col) {
+
+        // r traverses matrix row wise from first
+        int r = 0;
+        // c traverses matrix column wise from first
+        int c = 0;
+        int i;
+
+        List<Integer> result = new ArrayList<>();
+
+        while (r < row && c < col) {
+            // print first row of matrix
+            for (i = c; i < col; i++) {
+                result.add(matrix[r][i]);
+            }
+
+            // increase r by one because first row printed
+            r++;
+
+            // print last column
+            for (i = r; i < row; i++) {
+                result.add(matrix[i][col - 1]);
+            }
+
+            // decrease col by one because last column has been printed
+            col--;
+
+            // print rows from last except printed elements
+            if (r < row) {
+                for (i = col - 1; i >= c; i--) {
+                    result.add(matrix[row - 1][i]);
+                }
+
+                row--;
+            }
+
+            // print columns from first except printed elements
+            if (c < col) {
+                for (i = row - 1; i >= r; i--) {
+                    result.add(matrix[i][c]);
+                }
+                c++;
+            }
+        }
+        return result;
+    }
+}

src/main/java/com/thealgorithms/matrix/RotateMatrixBy90Degrees.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.matrix;
 
 import java.util.Scanner;
 /**

src/main/java/com/thealgorithms/matrix/matrixexponentiation/Fibonacci.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.matrixexponentiation;
+package com.thealgorithms.matrix.matrixexponentiation;
 
 import java.util.Scanner;
 
@@ -55,14 +55,14 @@ public final class Fibonacci {
      */
     public static int[][] fib(int n) {
         if (n == 0) {
-            return Fibonacci.IDENTITY_MATRIX;
+            return IDENTITY_MATRIX;
         } else {
             int[][] cachedResult = fib(n / 2);
             int[][] matrixExpResult = matrixMultiplication(cachedResult, cachedResult);
             if (n % 2 == 0) {
                 return matrixExpResult;
             } else {
-                return matrixMultiplication(Fibonacci.FIB_MATRIX, matrixExpResult);
+                return matrixMultiplication(FIB_MATRIX, matrixExpResult);
             }
         }
     }

src/test/java/com/thealgorithms/matrix/InverseOfMatrixTest.java

@@ -1,5 +1,4 @@
-package com.thealgorithms.misc;
-
+package com.thealgorithms.matrix;
 import static org.junit.jupiter.api.Assertions.assertArrayEquals;
 
 import java.util.stream.Stream;

src/test/java/com/thealgorithms/matrix/MatrixTransposeTest.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.matrix;
 
 import static org.junit.jupiter.api.Assertions.assertArrayEquals;
 import static org.junit.jupiter.api.Assertions.assertThrows;

src/test/java/com/thealgorithms/matrix/MedianOfMatrixTest.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.matrix;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
 

src/test/java/com/thealgorithms/matrix/MirrorOfMatrixTest.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.misc;
+package com.thealgorithms.matrix;
 
 import static org.junit.jupiter.api.Assertions.assertArrayEquals;
 import static org.junit.jupiter.api.Assertions.assertNull;

src/test/java/com/thealgorithms/matrix/TestPrintMatrixInSpiralOrder.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.matrix;
 
 import static org.junit.jupiter.api.Assertions.assertIterableEquals;