stl benchmarks

Using the Google Benchmark framework, demonstrate the performance of each of the following actions, operating on containers of a range of sizes:

Vector:

push_back, insert at front (myvic.insert(myvic.begin(), value), iterate through whole container, find, sort

Deque:

push_back, push_front, iterate through whole container, find, sort

List:

push_back, push_front, iterate through whole container, find, sort

Set:

insert, find, iterate through whole container

Unordered set:

insert, find, iterate through whole container