 It is also easily applied to lists, not only arrays, as it only requires sequential access, not random access.However, it has additional O("n") space complexity, and involves a large number of copies in simple implementations.Merge sort has seen a relatively recent surge in popularity for practical implementations, due to its use in the sophisticated algorithm Timsort, which is used for the standard sort routine in the programming languages Python and Java (as of JDK7).