Merge branch 'eugenp:master' into spring-web-test1

Author: programenth

README.md

@@ -3,7 +3,7 @@
 If you are getting an error while cloning the repository, try running:
 git config --global http.postBuffer 5000000
 
-This will increase the size of the buffer from the default 1MiB to 5MiB.
+This will increase the buffer size from the default 1MiB to 5MiB.
 
 To revert this value to the default, use:
 git config --global http.postBuffer 1000000
@@ -27,18 +27,18 @@ The Courses
 Java and Spring Tutorials
 ================
 
-This project is **a collection of small and focused tutorials** - each covering a single and well defined area of development in the Java ecosystem. 
-A strong focus of these is, of course, the Spring Framework - Spring, Spring Boot and Spring Security. 
-In addition to Spring, the modules here cover a number of aspects of Java. 
+This project is **a collection of small and focused tutorials** - each covering a single and well-defined area of development in the Java ecosystem. 
+A strong focus of these is the Spring Framework - Spring, Spring Boot and Spring Security. 
+In addition to Spring, the modules here cover several aspects of Java. 
 
-Profile based segregation
+Profile-based segregation
 ====================
 
-We are using maven build profiles to segregate the huge list of individual projects we have in our repository.
+We use Maven build profiles to segregate the huge list of individual projects in our repository.
 
 The projects are broadly divided into 4 lists: default, default-jdk17, default-jdk8 and default-heavy. 
 
-Next, they are segregated further on the basis of the tests that we want to execute.
+Next, they are segregated further based on the tests that we want to execute.
 
 We also have a parents profile to build only parent modules.
 
@@ -48,8 +48,8 @@ Therefore, we have a total of 9 profiles:
 |--------------------|-----------------------------|------------------------------|
 | default            | JDK21 projects              | *UnitTest                    |
 | integration        | JDK21 projects              | *IntegrationTest             |
-| default-jdk17      | JDK17 and above projects    | *UnitTest                    |
-| integration-jdk17  | JDK17 and above projects    | *IntegrationTest             |
+| default-jdk17      | JDK17 projects              | *UnitTest                    |
+| integration-jdk17  | JDK17 projects              | *IntegrationTest             |
 | profile-jdk22      | JDK22 projects              | *UnitTest & *IntegrationTest |
 | profile-jdk23      | JDK23 projects              | *UnitTest & *IntegrationTest |
 | default-heavy      | Heavy/long running projects | *UnitTest                    |

algorithms-modules/algorithms-miscellaneous-9/src/main/java/com/baeldung/algorithms/kthlargest/FindKthLargest.java

@@ -12,6 +12,36 @@ public int findKthLargestBySorting(Integer[] arr, int k) {
         return arr[targetIndex];
     }
 
+    public int findSecondLargestWithoutSorting(Integer[] arr) throws Exception{
+        Integer[] result = new Integer[2];
+
+        if (arr == null || arr.length < 2) {
+            throw new Exception(
+                "Array should have at least two elements and be not null");
+        } else {
+            if (arr[0] > arr[1]) {
+                result[0] = arr[0];
+                result[1] = arr[1];
+            } else {
+                result[0] = arr[1];
+                result[1] = arr[0];
+            }
+            if (arr.length > 2) {
+                for (int i = 2; i < arr.length; i++) {
+                    if (arr[i] > result[0]) {
+                        result[1] = result[0];
+                        result[0] = arr[i];
+
+                    } else if (arr[i] > result[1]) {
+                        result[1] = arr[i];
+                    }
+                }
+            }
+        }
+
+        return result[1];
+    }
+    
     public int findKthLargestBySortingDesc(Integer[] arr, int k) {
         Arrays.sort(arr, Collections.reverseOrder());
         return arr[k - 1];

algorithms-modules/algorithms-miscellaneous-9/src/test/java/com/baeldung/algorithms/kthlargest/FindKthLargestUnitTest.java

@@ -15,6 +15,11 @@ public void setup() {
         findKthLargest = new FindKthLargest();
     }
 
+    @Test
+    void givenIntArray_whenFindSecondLargestWithoutSorting_thenGetResult() throws Exception {
+        assertThat(findKthLargest.findSecondLargestWithoutSorting(arr)).isEqualTo(9);
+    }
+
     @Test
     void givenIntArray_whenFindKthLargestBySorting_thenGetResult() {
         int k = 3;

algorithms-modules/algorithms-sorting-2/README.md

@@ -1,13 +1,11 @@
 ### Relevant Articles:
 
 - [Sorting Strings by Contained Numbers in Java](https://www.baeldung.com/java-sort-strings-contained-numbers)
-- [Guide to In-Place Sorting Algorithm Works with a Java Implementation](https://www.baeldung.com/java-in-place-sorting)
 - [Partitioning and Sorting Arrays with Many Repeated Entries with Java Examples](https://www.baeldung.com/java-sorting-arrays-with-repeated-entries)
-- [Gravity/Bead Sort in Java](https://www.baeldung.com/java-gravity-bead-sort)
 - [Selection Sort in Java](https://www.baeldung.com/java-selection-sort)
 - [Bubble Sort in Java](https://www.baeldung.com/java-bubble-sort)
 - [Insertion Sort in Java](https://www.baeldung.com/java-insertion-sort)
 - [Heap Sort in Java](https://www.baeldung.com/java-heap-sort)
 - [Counting Sort in Java](https://www.baeldung.com/java-counting-sort)
 - [Radix Sort in Java](https://www.baeldung.com/java-radix-sort)
-- More articles: [[<-- prev]](/algorithms-modules/algorithms-sorting)
+- More articles: [[<-- prev]](/algorithms-modules/algorithms-sorting)[[next -->]](/algorithms-modules/algorithms-sorting-3)

algorithms-modules/algorithms-sorting-3/README.md

@@ -0,0 +1,7 @@
+### Relevant Articles:
+
+- [Bucket Sort in Java](https://www.baeldung.com/java-bucket-sort)
+- [Shell Sort in Java](https://www.baeldung.com/java-shell-sort)
+- [Gravity/Bead Sort in Java](https://www.baeldung.com/java-gravity-bead-sort)
+- [Guide to In-Place Sorting Algorithm Works with a Java Implementation](https://www.baeldung.com/java-in-place-sorting)
+- More articles: [[<-- prev]](/algorithms-modules/algorithms-sorting-2)

algorithms-modules/algorithms-sorting-3/pom.xml

@@ -0,0 +1,19 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns="http://maven.apache.org/POM/4.0.0"
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+    <modelVersion>4.0.0</modelVersion>
+    <artifactId>algorithms-sorting-3</artifactId>
+    <version>0.0.1-SNAPSHOT</version>
+    <name>algorithms-sorting-3</name>
+
+    <parent>
+        <groupId>com.baeldung</groupId>
+        <artifactId>algorithms-modules</artifactId>
+        <version>1.0.0-SNAPSHOT</version>
+    </parent>
+
+    <dependencies>
+    </dependencies>
+
+</project>