NewAlgorithm builds a heuristic algorithm.

UseFirst builds a compositite heuristic that will make the first non-nil suggestion from the sub-heuristics.

Algorithm searches for an addition sequence using a heuristic at each step.

Approximation is the "Approximation" heuristic from [boscoster].

DeltaLargest implements the simple heuristic of adding the delta between the largest two entries in the protosequence.

Halving is the "Halving" heuristic from [boscoster].

Heuristic suggests insertions given a current protosequence.