title: Time Complexity of std::vector::erase
body: <p>I've found a way to remove an element from an STL vector my its value <a href="https://stackoverflow.com/questions/39912/how-do-i-remove-an-item-from-a-stl-vector-with-a-certain-value">here</a>:</p>
  
  <pre><code>vec.erase(remove(vec.begin(), vec.end(), value), vec.end());
  </code></pre>
  
  <p>Now I'd like to know how efficient this method is, meaning its time complexity in Big O notation.</p>