x/box-o-sand
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

working through mit intro to algorithms, first with insertion sort

Browse Source
This commit is contained in:
Dan Buch 2011-08-15 06:35:27 -04:00
commit d5e7f537e6
1 changed files with 8 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
insertion_sort01.py Normal file
View File

@ -0,0 +1,8 @@
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