Add a generator of random triplets.

To enable reasonable merging, the maximum element value is
logarithmic in the number of triplets.
Add the implementation of 'Level 2: Very greedy'

The only integer argument to the script is the lookahead to perform.
Lookahead 0 means no lookahead, or the 'blind' algorithm. Lookahead
1 means 'Level1: Greedy' algorithm, anything larger means real
recursive lookahead as described under 'Level 2: Very greedy'.
Add bash script to search for lookahead differences

For a fixed triplet count, this script searches for a set of triplets
which produce different results for different lookaheads.

Differences between lookahead 0 and any other lookahead are very easy
to find, others may take a while if you're unlucky.

This scripts helps prove that neither algorithm (lookaheads 0, 1, and
greater than 1) are optimal.

(Also, ignore '/triplets', as generated by find_diff.sh)
Add two proofs for differences due to lookaheads

proof_0_1 shows the minimal example -- just three triplets -- where
the blind algorithm is worse off than lookahead 1 (Level 1: Greedy).

proof_2_3 shows that lookahead 3 can be better than lookahead 2, but
is especially interesting, because lookahead 0 yields the same result
as lookahead 3, while lookaheads 1 and 2 yield worse results. This
directly proves that a local optimum, according to defined heuristics
can lead further away from the global optimum.