refactor(matrix): Clean up code and improve formatting in MatrixDeterminant and its tests

Author: Rony-2004

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

@@ -1,28 +1,11 @@
+package com.thealgorithms.matrix;
+
 // Problem: Determinant of a Matrix
-// 
-// Implement a function to calculate the determinant of a square matrix.
-//
-// Requirements:
-// - The function should work for any n x n matrix.
-// - Return 0 if the matrix is singular (determinant = 0).
-// - Only square matrices are allowed; handle error for non-square matrices.
-//
-// Example:
-// double[][] matrix1 = {{1,2},{3,4}};
-// determinant(matrix1); // returns -2
-//
-// double[][] matrix2 = {{2,0,1},{3,0,0},{5,1,1}};
-// determinant(matrix2); // returns 3
-//
-// Notes:
-// - You can use recursion or any other suitable algorithm.
-// - Bonus: Optimize for larger matrices (optional).
 
-package com.thealgorithms.matrix;
+public final class MatrixDeterminant {
 
-public class MatrixDeterminant {
     private MatrixDeterminant() {
-        throw new AssertionError("Utility class");
+        // Prevent instantiation
     }
 
     public static double determinant(double[][] m) {
@@ -32,19 +15,13 @@ public static double determinant(double[][] m) {
                 throw new IllegalArgumentException("Matrix must be square");
             }
         }
-        if (n == 1) {
-            return m[0][0];
-        }
-
-        if (n == 2) {
-            return m[0][0] * m[1][1] - m[0][1] * m[1][0];
-        }
+        if (n == 1) return m[0][0];
+        if (n == 2) return m[0][0] * m[1][1] - m[0][1] * m[1][0];
 
         double det = 0;
         for (int c = 0; c < n; c++) {
             det += Math.pow(-1, c) * m[0][c] * determinant(minor(m, 0, c));
         }
-
         return det;
     }
 
@@ -53,22 +30,14 @@ private static double[][] minor(double[][] m, int row, int col) {
         double[][] min = new double[n - 1][n - 1];
         int r = 0;
         for (int i = 0; i < n; i++) {
-            if (i == row) {
-                continue;
-            }
-
+            if (i == row) continue;
             int c = 0;
             for (int j = 0; j < n; j++) {
-                if (j == col) {
-                    continue;
-                }
-
+                if (j == col) continue;
                 min[r][c++] = m[i][j];
             }
-
             r++;
         }
-
         return min;
     }
 }

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

@@ -1,9 +1,10 @@
 package com.thealgorithms.matrix;
 
-import org.junit.jupiter.api.Test;
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertThrows;
 
+import org.junit.jupiter.api.Test;
+
 class MatrixDeterminantTest {
 
     @Test