Recursively generate a list of comparisons that always subdivides the keys in the given
(inclusive) range in the middle (in terms of probability, not index). If left is bigger
than zero, then we always know that the value is equal to or bigger than the left key.
This does not hold for the right key, as there may be a gap afterwards.