🔄 Implement In-Place Merge Sort (Without Extra Array)

[HashSlap]

Description:
Most implementations of merge sort use extra space to merge arrays. For this issue, implement an in-place merge sort that:

Does not use additional arrays during the merge step

Uses index manipulation or swaps to keep space usage minimal

Includes proper time and space complexity in comments

Adds sample input/output in a README.md inside your language folder

📁 Example Path: sorting/in-place-merge-sort/in-place-merge-sort.py (or .cpp, .js, etc.)
📘 Difficulty: Intermediate
🛠 Languages: Your choice (Python, C++, JavaScript, etc.)

[SwarajKale04]

I want to work on this. Please Assign me.
Thankyou

[Vivaanfbcmc]

@SwarajKale04 Assigned

[daniel-oyoo]

I would like to work on this issue. Please assign me.

[daniel-oyoo]

I have implemented in-place merge sort in Java as requested.
The implementation includes:

• O(n log n) time complexity, O(1) auxiliary space for merging
• Updated documentation with complexity analysis
• PR will be submitted shortly.

[daniel-oyoo]

Pull request submitted