title: Which STL container should I use? C++
body: <p>I have a 'list' of objects, from which I want to take object at random position and push it on front of this list. Only this kind of operation will be performed. So I don't need a fast access to end of the list, only to it's front and average access to any other place. </p>
  
  <p>Which container would be the best for this? I was thinking about <code>std::vector</code>, but I've read that <code>insert</code> operation is not efficient. Then I came up with <code>std::deque</code> because of it's fast access to front, but what about efficiency of it's <code>erase</code> at specific position method?</p>
  
  <p>Thanks in advance for help.</p>