Merge Sort By python

mergeSort.py

def main():
    a = []
    for i in tuple(map(int,input("Enter the number : ").split(' '))):
        a.append(i)
    mergesSort(a)
    print(a)
    
def mergesSort(a):
    if len(a)>1:
        print("================================")
        print("Total array {}".format(a))
        print("================================")
        mid = len(a)//2
        leftHalf=a[:mid]
        rightHalf=a[mid:]
        print("================================")
        print("Left Side = ",leftHalf,"\t","Right Side = ",rightHalf)
        print("================================")
        mergesSort(leftHalf)
        mergesSort(rightHalf)
        
        i,j,k = 0,0,0
        while i < len(leftHalf) and j < len(rightHalf):
            if leftHalf[i]<rightHalf[j]:
                a[k]= leftHalf[i]
                i+=1
            else:
                a[k]=rightHalf[j]
                j+=1
            k+=1
        
        while i < len(leftHalf):
            a[k]=leftHalf[i]
            k+=1
            i+=1
        
        while j < len(rightHalf):
            a[k]=rightHalf[j]
            k+=1
            j+=1
            
            
            
        
                
if __name__=="__main__":main()