The Question
CodingMerge Sort Implementation
Implement the Merge Sort algorithm to sort an array of integers in ascending order. Your solution should follow the Divide and Conquer paradigm and maintain stability (the relative order of equal elements). Discuss the time and space complexity of your implementation, and ensure it handles edge cases such as empty arrays or arrays with a single element.
Java
Merge Sort
Recursion
Divide and Conquer