Sorting algorithms can be classiied in many diierent ways. The way presented here is by expressing the algorithms as functional programs and to classify them by means of their recursion patterns. These patterns on their turn can be classiied as the natural recursion patterns that destruct or construct a given data-type, the so called cata-and anamorphisms respectively. We show that the selectio...