title: Binary_search in STL set over set's member function find?
body: <p>Why do we have 2 ways like above to search for an element in the set?</p>
  
  <p>Also find algorithm can be used to find an element in a list or a vector but what would be the harm in these providing a member function as well as member functions are expected to be faster than a generic algorithm?</p>
  
  <p>Why do we need remove algorithm and create all the drama about erase remove where remove will just shift the elements and then use erase to delete the actual element..Just like STL list provides a member function remove why cant the other containers just offer a remove function and be done with it?</p>