def merge_sort(a):
    if len(a) > 1:
        mid = len(a) // 2

        L = a[:mid]
        R = a[mid:]

        merge_sort(L)
        merge_sort(R)

        i = j = k = 0

        while i < len(L) and j < len(R):
            if L[i] < R[j]:
                a[k] = L[i]
                i += 1
            else:
                a[k] = R[j]
                j += 1
            k += 1

        while i < len(L):
            a[k] = L[i]
            i += 1
            k += 1

        while j < len(R):
            a[k] = R[j]
            j += 1
            k += 1


a = [64, 25, 12, 22, 11]

merge_sort(a)

print("Sorted Array:")
for i in a:
    print(i, end=" ")