Added python skeleton

Aufgabe02.py

+def HeapSort(array):
+    '''Update the board according to the move and the player. If player 0 does
+    the move, set the board cell to -1. If payer 1 makes the move, set the board cell 
+    to 1 (empty board cells have value zero).
+    
+    Parameters
+    ----------
+    array: list(*int)
+        a list containing the integers to be sorted
+
+    Returns
+    -------
+    sorted_array: a sorted copy of the array
+    '''
+
+    return
+
+def InsertionSort(array):
+    '''Sort the array by inserting each element into an already sorted part of the array.
+    
+    Parameters
+    ----------
+    array: list(*int)
+        a list containing the intergers to be sorted
+
+    Returns
+    -------
+    sorted_array: a sorted copy of the array
+    '''
+
+    return
+
+def CountingSort(array):
+    '''Sort the array by counting the occurrence of each element in the array.
+    
+    Parameters
+    ----------
+    array: list(*int)
+        a list containing the intergers to be sorted
+
+    Returns
+    -------
+    sorted_array: a sorted copy of the array
+    '''
+
+    return