插入排序（insertionSort）python代码

def insertionSort(array):

    def caseSmall(array, indexItemFront, indexItemBack):
        raise Exception("安置完成")

    def caseLarge(array, indexItemFront, indexItemBack):
        array[indexItemFront], array[indexItemBack] = array[indexItemBack], array[indexItemFront]

    def compare(array, indexItemFront, indexItemBack):
        itemFront, itemBack = array[indexItemFront], array[indexItemBack]
        try:
            if itemFront < itemBack:
                caseLarge(array, indexItemFront, indexItemBack)
            else:
                caseSmall(array, indexItemFront, indexItemBack)
        except:
            return None

    def cycleCompare(array, indexItem):
        for indexItem in range(0, indexItem + 1):
            try:
                indexItemFrort = indexItem
                indexItemSmall = indexItem_Temp
                compare(array, indexItemFrort, indexItemSmall)
            except:
                pass
            indexItem_Temp = indexItem

    def cycleDraw(array):
        for indexItem in range(0, len(array)):
            cycleCompare(array, indexItem)
        return array

    def main(array):
        array = cycleDraw(array)
        return array

    return main(array)