Investigate: traversals other than {bisect, linear}

[foresterre]

• Galloping search -> exponential + binary
  • Can we use a better heuristic than exponential? Would e.g. fibonacci work?
• Can Zig Zagging improve average search time?\
  • i.e. something like Binary Search with Bidirectional Expansion
• Jump Search
• Interpolation Search
• Ternary Search

For all of these we should consider going from the end (ie more recent); I hypothesise that usually most projects have an MSRV closer to the most recent version than the least recent, especially if there are lots of versions.

Something to consider is that using the edition to limit the search space already makes the search space considerably smaller.