Merge branch 'BAEL-5534' of github.com:navuluri/tutorials into BAEL-5534

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

@@ -14,7 +14,7 @@ public class KadaneAlgorithm {
         int end = 0;
 
         int maxSoFar = arr[0], maxEndingHere = arr[0];
-        for (int i = 0; i < size; i++) {
+        for (int i = 1; i < size; i++) {
 
             if (arr[i] > maxEndingHere + arr[i]) {
                 start = i;

algorithms-modules/algorithms-miscellaneous-5/src/test/java/com/baeldung/algorithms/maximumsubarray/KadaneAlgorithmUnitTest.java

@@ -27,4 +27,16 @@ class KadaneAlgorithmUnitTest {
         //then
         assertEquals(-1, maxSum);
     }
+    
+    @Test
+    void givenArrayWithAllPosiitveNumbersWhenMaximumSubarrayThenReturnsExpectedResult() {
+        //given
+        int[] arr = new int[] {4, 1, 3, 2};
+        //when
+        KadaneAlgorithm algorithm = new KadaneAlgorithm();
+        int maxSum = algorithm.maxSubArraySum(arr);
+        //then
+        assertEquals(10, maxSum);
+    }
+
 }

apache-cxf-modules/cxf-aegis/pom.xml

@@ -8,7 +8,7 @@
 
     <parent>
         <groupId>com.baeldung</groupId>
-        <artifactId>apache-cxf</artifactId>
+        <artifactId>apache-cxf-modules</artifactId>
         <version>0.0.1-SNAPSHOT</version>
     </parent>
 

apache-cxf-modules/cxf-introduction/pom.xml

@@ -8,7 +8,7 @@
 
     <parent>
         <groupId>com.baeldung</groupId>
-        <artifactId>apache-cxf</artifactId>
+        <artifactId>apache-cxf-modules</artifactId>
         <version>0.0.1-SNAPSHOT</version>
     </parent>
 

apache-cxf-modules/cxf-jaxrs-implementation/pom.xml

@@ -8,7 +8,7 @@
 
     <parent>
         <groupId>com.baeldung</groupId>
-        <artifactId>apache-cxf</artifactId>
+        <artifactId>apache-cxf-modules</artifactId>
         <version>0.0.1-SNAPSHOT</version>
     </parent>