插入排序學習

 d = [int(i) for i in '3,5,1,4,2,7,9,6'.split(',')]

n = len(d)

print(d)

# right turn

# t = d[n-1]

# i = n-1

# while i>0:

#     d[i]=d[i-1]

#     i-=1

# d[0]=t

# print(d)

# left turn

# t = d[0]

# i = 0

# while i <n-1:

#     d[i]=d[i+1]

#     i+=1

# print(d)

# d[n-1]=t

# insert sort

# for j in range(1,n):

#     i = 0

#     while d[i] < d[j]:

#         i+=1

#     t =d[j]

#     d.remove(d[j])

#     d.insert(i,t)

# print(d)

# insert .. to right position

d.sort()

print(d)

t = 0

i = 0

if t>d[n-1]:

    d.append(t)

else:

    while d[i]<t and i<n:

        i+=1

    d.insert(i,t)

print(d)