Want a Haskell O(n) Sort for numerically indexable data types?, DON'T get it at my git-hub radix sort repository because, although the QuickCheck test-suite passes correctly, it is O((k+1) n), it uses the vector, sequence and dlist libraries (sequences for queues (with O(1) access on each end, and collected with "dlist" difference lists which have O(1) on append) , its performance, as tested in the included bench task, is much slower than Data.List.sort

Haskell Yesod users may appreciate using Markdown templates (with support for Textile, RST)