python 插入排序

import numpy as np
import copy
def insertSort(inputay):

length = len(inputay)
if(length <= 0):
    return

for i in range(1,length):
    current = inputay[i]
    j = i - 1
    movej = i
    while j>=0 and inputay[j]>current:
        movej = j
        inputay[j+1] = inputay[j]    
        j = j - 1
    inputay[movej] = current
return

#复制一个list
def insertSort2(inputay):
length = len(inputay)
if(length == 0):
return copy.copy(inputay)
ay = list(inputay)
for i in range(1,length):
j = i -1
current = ay[i]
insertj = i
while j>=0 and ay[j]>current:
insertj = j
j = j-1

    if insertj != i:
        ay.remove(current)
        ay.insert(insertj,current)
return ay

ay = [5,4,3,2,1,0]
#insertSort(ay)

ay = [5,4,3,2,1,0]
by = insertSort2(ay)