Example project for benchmarking performance of various Fibonacci numbers implementations
% stack build
% stack exec fib -- <benchmark> <strategy> <n>
None
= no benchmark in Haskell, can be used withtime
utilWithCriterion
= using criterion (default settings)WithWeight
= using weight (default settings)
Naive
= intentionally stupid recursion