working through mit intro to algorithms, first with insertion sort

2011-08-15 06:35:27 -04:00 · 2011-08-15 06:35:27 -04:00 · d5e7f537e6
commit d5e7f537e6
1 changed files with 8 additions and 0 deletions
--- a/insertion_sort01.py
+++ b/insertion_sort01.py
@ -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