dd Merge Sort Algorithm in Java #6280
Closed
+210
−0
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
added 5 commits
June 8, 2025 17:59
Codecov ReportAll modified and coverable lines are covered by tests ✅
Additional details and impacted files@@ Coverage Diff @@
## master #6280 +/- ##
============================================
- Coverage 74.07% 74.06% -0.01%
+ Complexity 5351 5350 -1
============================================
Files 677 677
Lines 18648 18648
Branches 3621 3621
============================================
- Hits 13813 13812 -1
Misses 4276 4276
- Partials 559 560 +1 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
|
Same as in #6281 (comment). |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This pull request adds a recursive implementation of the Merge Sort algorithm under Sorting/MergeSort.java.
What this PR includes:
• Full implementation of Merge Sort using the divide and conquer strategy
• Recursive method to split the array into halves
• Merging logic to combine sorted subarrays
• Sample input and output in the main() method
• Time complexity: O(n log n)
Why Merge Sort?
• Merge Sort is significantly faster than O(n²) algorithms like Bubble or Insertion Sort on larger datasets.
• It is stable and has consistent performance across input types.
• Demonstrates recursion, modular logic, and efficient array handling.
This contribution enhances the Sorting section of the repo with a mid-level, industry-relevant sorting algorithm.