Implemented InsertionSort

Aufgabe02.py

@@ -28,7 +28,16 @@ def InsertionSort(array):
     sorted_array: a sorted copy of the array
     '''
 
-    return
+    sorted_array = list(array)
+
+    for i in range(1, len(array)):
+        for j in range(i, 1, -1):
+            if sorted_array[j] < sorted_array[j-1]:
+                sorted_array[j], sorted_array[j-1] = sorted_array[j-1], sorted_array[j]
+            else:
+                continue
+
+    return sorted_array
 
 def CountingSort(array):
     '''Sort the array by counting the occurrence of each element in the array.