More benchmarks

[noughtmare]

Ideas:

• Quicksort
• Sieve of Eratosthenes
• Backtracking solver, for example for Sudoku.
• Graph algorithms like Dijkstra's algorithm. (A graph can be represented as a compressed sparse row matrix)
• Hash tables (using open addressing)
• The memory of a virtual machine
• Advent of code (or other online) challenges
• A gap buffer or piece table for text editing
• Physics simulation

Benchmarks could compare against:

• a mutable array implementation
• a naive immutable array implementation
• an IntMap implementation
• lists
• Data.Sequence