Implement an optimization for the Merge Sort algorithm that handles cases where the array is already partially sorted. This optimization should minimize the number of comparisons and copies in scenarios where the array has large sorted subsequences. To do this, add an early termination condition that checks if the sub-arrays are already ordered relative to each other.