def merge_sort(arr):
<EOL>if len(arr) <= <NUM_LIT:1>:<EOL><INDENT>return arr<EOL><DEDENT>mid = len(arr) // <NUM_LIT:2><EOL>left, right = merge_sort(arr[:mid]), merge_sort(arr[mid:])<EOL>return merge(left, right, arr.copy())<EOL>
Merge Sort
        Complexity: O(n log(n))