In this project, I was requested to build an application to manage Queues (something like the ones you find when you want to view the latest Blockbuster movie). OK, It sounds simple, use a STL queue. Unfortunately, this is not the whole requirement. Being a graphical application, it requested to refresh the screen from time to time showing all the items in the queue. After some research I was not able to find a way to access elements inside the queue, only the Front and Back elements were accessible [if this is possible, let me know]. So, I had to take a look at other containers in STL in order to be able to get the functionality with good performance. I have selected 4 containers to accomplish this task : Queue (Only to measure it's performance), Lists, Vectors and Deques. All of them included members to work like Queues: - Queue: push(int), front(), pop() - List: push_back(int), front() and pop_front() - Vector: push_back(int), front() and erase(vector::begin()) - Deque: ...