BAEL3455 Max subarray problem

algorithms-miscellaneous-5/src/main/java/com/baeldung/algorithms/maximumsubarray/BruteForceAlgorithm.java

@@ -1,7 +1,12 @@
-package com.baeldung.algorithms.subarray.maximum;
+package com.baeldung.algorithms.maximumsubarray;
+
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
 
 public class BruteForceAlgorithm {
 
+    private Logger logger = LoggerFactory.getLogger(BruteForceAlgorithm.class.getName());
+
     public int maxSubArray(int[] arr) {
 
         int size = arr.length;
@@ -23,7 +28,7 @@ public class BruteForceAlgorithm {
                 }
             }
         }
-        System.out.println("Found Maximum Subarray between " + start + " and " + end);
+        logger.info("Found Maximum Subarray between {} and {}", start, end);
         return maximumSubArraySum;
     }
 

algorithms-miscellaneous-5/src/main/java/com/baeldung/algorithms/maximumsubarray/KadaneAlgorithm.java

@@ -1,7 +1,12 @@
-package com.baeldung.algorithms.subarray.maximum;
+package com.baeldung.algorithms.maximumsubarray;
+
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
 
 public class KadaneAlgorithm {
 
+    private Logger logger = LoggerFactory.getLogger(BruteForceAlgorithm.class.getName());
+
     public int maxSubArraySum(int[] arr) {
 
         int size = arr.length;
@@ -23,7 +28,7 @@ public class KadaneAlgorithm {
                 end = i;
             }
         }
-        System.out.println("Found Maximum Subarray between " + start + " and " + end);
+        logger.info("Found Maximum Subarray between {} and {}", start, end);
         return maxSoFar;
     }
 }