The goal of this challenge is to perform an amortized cost analysis on the insertion and search operation of some containers of the C++ STL (Standard Template Library):
std::vector
std::deque
std::set
std::unordered_set
Google Benchmark platform: [https://github.com/google/benchmark]