Python 实现插入排序

# Sorts a sequence in ascending order using the insertion sort alogithm
def insertionSort(theSeq):
    n = len(theSeq)
    # Starts with the first item as the only sorted entry
    for i in range(1, n):
        # Save the value to be positioned
        value = theSeq[i]
        # find the position where value fits in the ordered part of the list
        pos = i
        while pos > 0 and value < theSeq[pos-1]:
            # shift the items to the right during the search
            theSeq[pos] = theSeq[pos-1]
            pos -= 1

        # Put the saved value into the open slot
        theSeq[pos] = value

In [7]: theSeq = [3,7,5,2,9,10]

In [8]: insertionSort(theSeq)

In [9]: theSeq
Out[9]: [2, 3, 5, 7, 9, 10]