sorted by: recent | see :
popular
Content Tagged with monads + algorithms
Quicksort in Haskell
Lennart Augustsson demonstrates the true quicksort (with destructive updates) in Haskell. This is not what is usually provided as an example.
A Neighborhood of Infinity: How to write tolerably efficient optimzation code without really trying...
"a simple DSL for specifying a wide range of optimisation problems with polynomial instead of exponential complexity."
ASPN : Python Cookbook : List/Generator Monad Combinators
The List monad in Haskell has many uses, including parsing and nondeterministic algorithms. This code implements the Monad combinators "bind", "return" and "fail", and the MonadPlus combinators "plus" and "zero". It works with all iterables, and returns a
