def msort(arr):    
    if len(arr) <= 1:
        return arr

    mid = len(arr) // 2
    left = msort(arr[:mid]) 
    right = msort(arr[mid:])

    return merge(left, right)

def merge(left, right):
    merged = []
    i, j = 0, 0

    while i < len(left) and j < len(right):
        if left[i] < right[j]:
            merged.append(left[i])
            i += 1
        else:
            merged.append(right[j])
            j += 1

    while i < len(left):
        merged.append(left[i])
        i += 1

    while j < len(right):
        merged.append(right[j])
        j += 1

    return merged


# driver code
arr = [5,2,4,1,3]
print(arr)
print(msort(arr))