Sorting

Author: codehariom

sorting/InsertionSort.py

@@ -0,0 +1,15 @@
+def insertionsort(A):
+    n = len(A)
+    for i in range(1,n):
+        cvalue = A[i]
+        position = i
+        while position > 0 and A[position-1] > cvalue:
+            A[position] = A[position-1]
+            position = position - 1
+        A[position] = cvalue
+
+
+A = [3,5,8,9,6,2]
+print('Original Array:',A)
+insertionsort(A)
+print('Sorted Array:',A)