[REQUEST] Add Merge Sort in Java

Algorithm Name

Merge Sort

Programming Language

Java

Category

Sorting

Difficulty Level

Medium (Intermediate)

Algorithm Description

Merge Sort is a divide-and-conquer algorithm that splits an array into two halves, recursively sorts each half, and then merges the sorted halves to form a fully sorted list. It is highly efficient with a time complexity of O(n log n) in the worst, average, and best cases, making it reliable compared to algorithms like Quick Sort, which may degrade to O(n²). Merge Sort is a stable sorting algorithm, preserving the order of equal elements, and performs well with large datasets. It is also ideal for linked lists and external sorting where data cannot fit into memory, as merging is easily managed on disk.

References (Optional)

No response

Contribution Intent

• I would like to implement this algorithm myself
• I'm requesting this for someone else to implement
• I need help implementing this algorithm

Code of Conduct

• I agree to follow this project's Code of Conduct