Add Concurrent Merge Sort Implementation

[anshullakra007]

Add Concurrent Merge Sort Implementation

Description

This PR introduces a ConcurrentMergeSort algorithm that accelerates the standard divide-and-conquer Merge Sort by distributing sub-array sorting tasks across multiple threads utilizing a ThreadPoolExecutor.

To prevent the overhead of thread creation and context switching from ruining overall performance, this implementation incorporates a sequential fallback threshold (set to 8,192 elements). Once a sub-array's size drops below this threshold—or when a safe maximum concurrency depth is reached—the algorithm smartly switches to a standard sequential Merge Sort. This design prevents thread starvation deadlocks and ensures optimal CPU resource utilization.

Time & Space Complexity

• Time Complexity: $\mathcal{O}(N \log N)$ - The array is consistently divided in half and merged linearly. The concurrent threads distribute this workload without altering the fundamental algorithmic complexity.
• Space Complexity: $\mathcal{O}(N)$ - A temporary array of size $N$ is allocated once for the merging phases, alongside $\mathcal{O}(\log N)$ auxiliary stack space utilized by the recursive calls.

Testing

Comprehensive and strictly deterministic JUnit 5 tests have been added in ConcurrentMergeSortTest.java to guarantee reliability:

• Pre-sorted data: Verified correct handling on both strictly ascending and strictly descending arrays.
• Identical elements: Ensured correct sorting and stability for arrays filled with identical values.
• Edge cases: Successfully tested against empty ([]) and single-element ([42]) arrays.
• Large datasets: Executed a load test with 100,000 randomly generated elements (using a fixed Random(42) seed for CI determinism) to intentionally exceed the 8,192 sequential threshold, verifying the multithreaded pathways against Java's heavily optimized built-in Arrays.sort().

Checklist

• Code is formatted according to the repository's standard style guidelines.
• No wildcard imports are used; all dependencies are explicitly imported.
• Proper Javadocs are included for classes and public methods, detailing complexities.
• JUnit 5 tests are exhaustive, deterministic, and pass successfully.
• The executor thread pool cleanly shuts down via a finally block, preventing CI/CD pipeline hangs.

[codecov-commenter]

Codecov Report

✅ All modified and coverable lines are covered by tests.
✅ Project coverage is 80.33%. Comparing base (af9aad3) to head (fc8ab59).

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #7544      +/-   ##
============================================
+ Coverage     80.32%   80.33%   +0.01%     
- Complexity     7406     7418      +12     
============================================
  Files           812      813       +1     
  Lines         23914    23951      +37     
  Branches       4706     4710       +4     
============================================
+ Hits          19208    19242      +34     
  Misses         3945     3945              
- Partials        761      764       +3     

☔ View full report in Codecov by Harness.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.