All sorting algorithms, that we have seen pseudo code of, programmed in python. I tried to stay as close as possible to the pseudo-code, while keeping the code readable. This includes insertion-, merge-, quick-, radix-, and heap-sort. A helper class is included, to easily keep track of duplicate numbers, to see if an algorithm is stable. The document is provided as a .pdf and .md (source) file.