Intended for internal use at THM only, within the context of introductory lectures on "Algorithms and Data Structures". A wide range of different algorithms can be tried out interactively. For example, Quicksort, Heapsort, binary search, AVL trees, map coloring, and several more.