Merge pull request #4 from sunny3p/master

Merge Sort without Slicing

sorting/insertionSort.py

@@ -0,0 +1,18 @@
+
+# coding: utf-8
+
+# In[55]:
+
+
+alist = [54,26,93,17,77,31,44,55,20]
+def insertionSort(alist):
+    for index in range(1,len(alist)):
+        currentvalue = alist[index]
+        position = index
+        while position>0 and alist[position-1]>currentvalue:
+            alist[position]=alist[position-1]
+            position = position-1
+        alist[position]=currentvalue
+    return alist
+print(insertionSort(alist))
+