sort

 #select sort

#d = [1,3,5,7,9,10,8,6,2,4]

#n = len(d)

#for i in range(n):

#    imin = i

#    for j in range(i+1,n):

#        if d[j]<d[imin]:

#            imin=j

#    d[i],d[imin]=d[imin],d[i]

#    print(d)    

# insert sord

d = [3,1,5,7,9,10,8,6,2,4]

n= len(d)

dd = [-99,99]

for i in range(n):

    j=0

    while d[i]>dd[j] and j+1<len(dd):j+=1

    dd = dd[:j]+[d[i]]+dd[j:]

dd = dd[1:-1]    

print(dd)

#[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]