revised InsertionSort

Author: joeyajames

SortingAlgorithms.py

@@ -13,7 +13,7 @@
 # not optimized, equiv to while version below, but uses for loop
 def insertion_sort1(A):
 	for i in range(1, len(A)):
-		for j in range(i-1, 0, -1):
+		for j in range(i-1, -1, -1):
 			if A[j] > A[j+1]:
 				A[j], A[j+1] = A[j+1], A[j]
 			else: