insertion sort

def insertion_sort(ls):
    for i in range(1,len(ls)-1):
        value = ls[i]
        j= i
        while j > 0 and ls[j-1]  > value:
            ls[j]=ls[j-1]
            j=j-1
        ls[j]=value
    return ls
from random import*
ls=[randint(0,100) for _ in range(10)]
print(*ls)
print(*insertion_sort(ls))