September Morn Update

Task/Sorting-algorithms-Insertion-sort/Python/sorting-algorithms-insertion-sort-1.py

@@ -1,8 +1,8 @@
-def insertion_sort(l):
-    for i in xrange(1, len(l)):
+def insertion_sort(L):
+    for i in xrange(1, len(L)):
         j = i-1
-        key = l[i]
-        while (l[j] > key) and (j >= 0):
-           l[j+1] = l[j]
+        key = L[i]
+        while (L[j] > key) and (j >= 0):
+           L[j+1] = L[j]
            j -= 1
-        l[j+1] = key
+        L[j+1] = key

Task/Sorting-algorithms-Insertion-sort/Python/sorting-algorithms-insertion-sort-2.py

@@ -1,15 +1,6 @@
-def insertion_sort_bin(seq):
-    for i in range(1, len(seq)):
-        key = seq[i]
-        # invariant: ``seq[:i]`` is sorted
-        # find the least `low' such that ``seq[low]`` is not less then `key'.
-        #   Binary search in sorted sequence ``seq[low:up]``:
-        low, up = 0, i
-        while up > low:
-            middle = (low + up) // 2
-            if seq[middle] < key:
-                low = middle + 1
-            else:
-                up = middle
-        # insert key at position ``low``
-        seq[:] = seq[:low] + [key] + seq[low:i] + seq[i + 1:]
+def insertion_sort(L):
+    for i, value in enumerate(L):
+        for j in range(i - 1, -1, -1):
+            if L[j] > value:
+                L[j + 1] = L[j]
+                L[j] = value

Task/Sorting-algorithms-Insertion-sort/Python/sorting-algorithms-insertion-sort-3.py

@@ -1,4 +1,15 @@
-import bisect
 def insertion_sort_bin(seq):
     for i in range(1, len(seq)):
-        bisect.insort(seq, seq.pop(i), 0, i)
+        key = seq[i]
+        # invariant: ``seq[:i]`` is sorted
+        # find the least `low' such that ``seq[low]`` is not less then `key'.
+        #   Binary search in sorted sequence ``seq[low:up]``:
+        low, up = 0, i
+        while up > low:
+            middle = (low + up) // 2
+            if seq[middle] < key:
+                low = middle + 1
+            else:
+                up = middle
+        # insert key at position ``low``
+        seq[:] = seq[:low] + [key] + seq[low:i] + seq[i + 1:]

Task/Sorting-algorithms-Insertion-sort/Python/sorting-algorithms-insertion-sort-4.py

@@ -0,0 +1,4 @@
+import bisect
+def insertion_sort_bin(seq):
+    for i in range(1, len(seq)):
+        bisect.insort(seq, seq.pop(i), 0, i)