Merge_sort

def merge_sort(ls):
    if len(ls)<=1:
        return ls
    mid = len(ls)//2
    left=ls[:mid]
    right=ls[mid:]
    merge_sort(left)
    merge_sort(right)
    i=0;j=0;k=0
    while i <len(left) and j <len(right):
        if left[i] <right[j]:
            ls[k]=left[i]
            i+=1
        else:
            ls[k]= right[j]
            j+=1
        k+=1
    while i <len(left):
        ls[k]=left[i]
        i+=1
        k+=1
    while j <len(right):
        ls[k]= right[j]
        j+=1
        k+=1
    return ls
from random import*
ls=[randint(0,100) for _ in range(10)]
print(*ls)
print(*merge_sort(ls))