feat(sorting):Implement in-place merge sort in Java for issue #19 #37
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
- Implement merge sort with O(1) auxiliary space for merging - Time: O(n log n), Space: O(log n) recursion stack - Add 7 test cases with edge case coverage - Document algorithm and complexity analysis in README Resolves HashSlap-Summer-of-Code#19
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Description
This PR adds a Java implementation of in-place merge sort as requested in issue #19.
Changes Made
InPlaceMergeSort.javawith complete in-place merge sort implementationREADME.mdwith comprehensive documentation and complexity analysisKey Features
Sample Output
Test Case 1: Unsorted Array
Input: [12, 11, 13, 5, 6, 7]
Output: [5, 6, 7, 11, 12, 13]
Issue Reference
Resolves #19
Closes #19