檢視插入排序法的原始碼

{{Nav|程式語言、邏輯學}}

insertSort.py
<pre>
l = [3,1,4,1,5,9,2,6] // list

def insert_sort(ls):
    length = len(ls)

    for i in range (1, length):
        tmp = None
        j = i-1
        while ls[j] >= ls[j+1] and j >= 0:
            tmp = ls[j]
            ls[j] = ls[j+1]
            ls[j+1] = tmp
            j = j-1
    return ls

insert_sort(l)
</pre>

[[category:演算法]]