merge_sort

with open('sort.txt') as f:
    for lines in f:
        lines = [int(x) for x in lines.split(',')]
arr = lines
def merge(array_left, array_right):
    line = []
    i = 0
    j = 0
    temp = 0

    while i < len(array_left) and j < len(array_right):
        if  array_left[i] <= array_right[j]:
            line += [array_left[i]]
            i += 1
            temp += 1
        else:
            line += [array_right[j]]
            j += 1
            temp += 1
    line += array_left[i:]
    line += array_right[j:]
    return line

def mergesorts(arr):
    if len(arr) < 2:
        return arr
    mid = int(len(arr)/2)
    array_left = mergesorts(arr[:mid])
    array_right = mergesorts(arr[mid:])
    return merge(array_left, array_right)

print(mergesorts(arr))
input()