MI-AFP / fibonacci-performance

Working with performance on Fibonacci numbers example

fibonacci-performance

Example project for benchmarking performance of various Fibonacci numbers implementations

Usage

% stack build
% stack exec fib -- <benchmark> <strategy> <n>

Benchmarks

• None = no benchmark in Haskell, can be used with time util
• WithCriterion = using criterion (default settings)
• WithWeight = using weight (default settings)

Strategies

• Naive = intentionally stupid recursion