simple, unomptimized version listing narcissistic numbers
whitespace fix
slight optimization, next step is to rewrite check to be faster
Much faster version, checking uses sorting to see if two lists are equal, rather than iterating over all permuations of all numbers
runs out of memory before getting to n=25, probably an issue with passing round so many lists
added a main method, runs out of memory even when compiled
Added quicksort via two different methods, the obvious impl and one that should be twice as fast in theory
Revert "Added quicksort via two different methods, the obvious impl and one that should be twice as fast in theory"

This reverts commit 1c3b47d294dff5e81e52d2eec909291f240ca9b1.
Update old snippets, added a monad exersises hasekll file