def merge(left, right):
    combined, left_index, right_index = [], 0, 0
    while left_index < len(left) and right_index < len(right):
        if left[left_index] < right[right_index]:
            combined.append(left[left_index])
            left_index += 1
            continue
        combined.append(right[right_index])
        right_index += 1
    combined += left[left_index:] + right[right_index:]
    return combined


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(merge_sort([8, 6, 3, 0, 4, 5, 3, 9, 2]))

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]

>>> int(3/2)
1
>>> 3//2
1

rootVIII Wrote:EDIT: Yup Gribouillis you always know all the good modules hahaha