merge sort

[Gribouillis]

What about this one?

from heapq import merge

def merge_sort(current):
    if len(current) < 2:
        return current
 
    m = int(len(current)/2)
    return merge(merge_sort(current[:m]), merge_sort(current[m:]))
 
 
if __name__ == '__main__':
    print(list(merge_sort([8, 6, 3, 0, 4, 5, 3, 9, 2])))

Output:
[0, 2, 3, 3, 4, 5, 6, 8, 9]