def merge_sort(arr):
    if len(arr) <= 1:
        return arr
 
    mid = len(arr) // 2
    left = merge_sort(arr[:mid])
    right = merge_sort(arr[mid:])
    result = []
    i = j = 0
 
    while i < len(left) and j < len(right):
        if left[i] < right[j]:
            result.append(left[i])
            i += 1
        else:
            result.append(right[j])
            j += 1
    result.extend(left[i:])
    result.extend(right[j:])
 
    return result
 
lst = [38, 27, 43, 3, 9, 82, 10]
sorted_lst = merge_sort(lst)
 
print(sorted_lst)
 

ZGVmIG1lcmdlX3NvcnQoYXJyKToKICAgIGlmIGxlbihhcnIpIDw9IDE6CiAgICAgICAgcmV0dXJuIGFycgoKICAgIG1pZCA9IGxlbihhcnIpIC8vIDIKICAgIGxlZnQgPSBtZXJnZV9zb3J0KGFycls6bWlkXSkKICAgIHJpZ2h0ID0gbWVyZ2Vfc29ydChhcnJbbWlkOl0pCiAgICByZXN1bHQgPSBbXQogICAgaSA9IGogPSAwCiAgICAKICAgIHdoaWxlIGkgPCBsZW4obGVmdCkgYW5kIGogPCBsZW4ocmlnaHQpOgogICAgICAgIGlmIGxlZnRbaV0gPCByaWdodFtqXToKICAgICAgICAgICAgcmVzdWx0LmFwcGVuZChsZWZ0W2ldKQogICAgICAgICAgICBpICs9IDEKICAgICAgICBlbHNlOgogICAgICAgICAgICByZXN1bHQuYXBwZW5kKHJpZ2h0W2pdKQogICAgICAgICAgICBqICs9IDEKICAgIHJlc3VsdC5leHRlbmQobGVmdFtpOl0pCiAgICByZXN1bHQuZXh0ZW5kKHJpZ2h0W2o6XSkKICAgIAogICAgcmV0dXJuIHJlc3VsdAoKbHN0ID0gWzM4LCAyNywgNDMsIDMsIDksIDgyLCAxMF0Kc29ydGVkX2xzdCA9IG1lcmdlX3NvcnQobHN0KQoKcHJpbnQoc29ydGVkX2xzdCkK

MSAzIDcgNSAyIDQ=

1 3 7 5 2 4