Testing of following search algorithms: linear, jump, binary and ternary search.
Benchmarking is done through Timer class. Constructor initiates the timer, while destructor calculates the time since start. To avoid the time-keeping variable going out of scope, shared_ptr functionality is used.
Output is written to a console. In addition, sciplot library is used to plot the results onto a graph, which will pop up upon program finishes its execution.
Basic tests are added to check the search algorithm actually finds correct value.