box-o-sand/insertion_sort01.py

def insertion_sort(a):
    for j in range(1, len(a)):
        key = a[j]
        i = j - 1
        while i >= 0 and a[i] > key:
            a[i + 1] = a[i]
            i = i - 1
        a[i + 1] = key
adding a test for first example 2011-08-15 10:47:22 +00:00			`def insertion_sort(a):`
			`for j in range(1, len(a)):`
			`key = a[j]`
working through mit intro to algorithms, first with insertion sort 2011-08-15 10:35:27 +00:00			`i = j - 1`
adding a test for first example 2011-08-15 10:47:22 +00:00			`while i >= 0 and a[i] > key:`
			`a[i + 1] = a[i]`
working through mit intro to algorithms, first with insertion sort 2011-08-15 10:35:27 +00:00			`i = i - 1`
adding a test for first example 2011-08-15 10:47:22 +00:00			`a[i + 1] = key`