## Sorting algorithms #

The classic introduction to computational complexity for the unintiated is through sorting algorithms, which are intuitive and useful (around 25% of CPU cycles are spent sorting) and provide interesting examples that motivate the general theory.