Implement "Are we fast yet" benchmarks

[degustaf]

From here

• Micro Benchmarks

  • Bounce simulates a ball bouncing within a box.
  • List recursively creates and traverses lists.
  • Permute generates permutations of an array.
  • Queens solves the eight queens problem.
  • Sieve finds prime numbers based on the sieve of Eratosthenes.
  • Storage creates and verifies a tree of arrays to stress the garbage collector.
  • Towers solves the Towers of Hanoi game.

• Macro Benchmarks

  • CD is a simulation of an airplane collision detector.
  • DeltaBlue implements a constraint solver.
  • Havlak implements a loop recognition algorithm.
  • Json is a JSON string parsing benchmark.
  • Richards is a classic benchmark simulating an operating system kernel.