Add an exponential search algorithm

[SteveCheesley]

Story

As a consumer of the library I would like the ability to search a data set using an exponential search method So that I can make searches on large and / or complex data sets, using the most efficient method possible

Acceptance Criteria

• The algorithm is setup with an appropriate level of unit test coverage to ensure functionality
• Additional performance testing (as appropriate) is added to the framework
• Appropriate user documentation is created

User Documentation

TODO: Complete the user documentation for this search algorithm based off of the example below.

This is the simplest of all searching algorithms. It simply steps through items in a set and checks each item to see if it matches the required element. You can either stop after the first match is found, or return a set of all matching items.

Matching should be provided, as before, by a lambda that compares two objects in some way.

The use of this search is if you have a small set of data that you wish to search through. This is the most efficient way from a resource perspective to seach a small set. If you have a larger set of data (20 items or more) then I would recommend selecting a more efficient search algorithm.

Can be applied to an unsorted or a sorted set of data

[SteveCheesley]

Update: So, I've decided to take a detour and overhaul the input validation. I'm going to pick it up in a separate ticket because it's worth it. I believe that it is critical to the MVP release to get this issue resolved, in a way that makes it simple and pain-free for the consumer to use.

[SteveCheesley]

This is now on hold officially whilst I complete work on the input validation.