Code clean-up

Author: phishman3579

src/com/jwetherell/algorithms/mathematics/LUDecomposition.java

@@ -10,15 +10,17 @@
  * LU decomposition of matrix M produces 2 matrices L and U such that M = L*U
  * where L is lower triangular matrix and U is upper triangular matrix
  * <p>
- * https://en.wikipedia.org/wiki/LU_decomposition
+ * @see <a href="https://en.wikipedia.org/wiki/LU_decomposition">LU Decomposition (Wikipedia)</a>
  * <br>
  * @author Mateusz Cianciara <[email protected]>
+ * @author Justin Wetherell <[email protected]>
  */
 public class LUDecomposition {
+
+    private int n = 0;
     private Double[][] L = null;
     private Double[][] A = null;
     private Integer[] permutation = null;
-    private int n = 0;
 
     public Matrix<Double> getL() {
         return new Matrix<Double>(n, n, L);
@@ -33,9 +35,9 @@ public List<Integer> getPermutation() {
     }
 
     public LUDecomposition(Matrix<Double> input) {
-        if (input.getCols() != input.getRows()) {
+        if (input.getCols() != input.getRows())
             throw new IllegalArgumentException("Matrix is not square");
-        }
+
         n = input.getCols();
         L = new Double[n][n];
         A = new Double[n][n];
@@ -68,22 +70,25 @@ public LUDecomposition(Matrix<Double> input) {
                     double temp = A[row][i];
                     A[row][i] = A[max_in_col][i];
                     A[max_in_col][i] = temp;
+
                     if (i < row) {
                         temp = L[row][i];
                         L[row][i] = L[max_in_col][i];
                         L[max_in_col][i] = temp;
                     }
                 }
-                int temp = permutation[row];
+                final int temp = permutation[row];
                 permutation[row] = permutation[max_in_col];
                 permutation[max_in_col] = temp;
             }
+
             //zero column number row
-            double p = A[row][row];
-            if (p == 0) return;
+            final double p = A[row][row];
+            if (p == 0)
+                return;
 
             for (int i = row + 1; i < n; i++) {
-                double y = A[i][row];
+                final double y = A[i][row];
                 L[i][row] = y / p;
 
                 for (int j = row; j < n; j++) {

test/com/jwetherell/algorithms/mathematics/test/LUDecompositionTest.java

@@ -6,8 +6,8 @@
 
 import static org.junit.Assert.*;
 
-
 public class LUDecompositionTest {
+
     private boolean epsiMatrixCompare(Matrix<Double> a, Matrix<Double> b, double epsi) {
         if (a.getRows() != b.getRows() || a.getCols() != b.getCols()) {
             throw new IllegalArgumentException("Matrices are not the same shape");