Benchmarking in Haskell (with a guest appearance from Rust)

Last time we implemented 2 different solutions for a coding interview problem: one that uses Data.Map and another one with MArray and ST. This time we’ll benchmark those solution (and the one guest solution) and see how they compare to each other and to yet another solution written in Rust.

• Source code: link to Github.
• Cabal documentation about benchmarks: link to docs.
• Criterion documentation: link to Hackage.
• random-shuffle documentation: link to Hackage.
• Guest solution by Radu Grigore: link to GitHub Gist.