refactor(matrix): Enhance code clarity by improving comments and formatting in determinant method

Author: Rony-2004

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

@@ -1,6 +1,8 @@
 package com.thealgorithms.matrix;
 
 // Problem: Determinant of a Matrix
+// Description: Calculate the determinant of any square matrix using recursion.
+// URL: https://en.wikipedia.org/wiki/Determinant
 
 public final class MatrixDeterminant {
 
@@ -15,16 +17,17 @@ 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];
         }
 
         double det = 0;
         for (int c = 0; c < n; c++) {
-            if (c == 0) {} // optional placeholder for clarity; main logic below
             det += Math.pow(-1, c) * m[0][c] * determinant(minor(m, 0, c));
         }
         return det;
@@ -34,6 +37,7 @@ private static double[][] minor(double[][] m, int row, int col) {
         int n = m.length;
         double[][] min = new double[n - 1][n - 1];
         int r = 0;
+
         for (int i = 0; i < n; i++) {
             if (i == row) {
                 continue;