Linear / insertion sort in Python

linear.py

haystack = [5,3,2,4,1]

for i in range(1, len(haystack)):
    x = haystack[i]
    c = i
    while c > 0 and haystack[c-1] > x:
        haystack[c] = haystack[c-1]
        c = c - 1
    haystack[c] = x

print haystack