title: Fastest way to search and sort vectors
body: <p>I'm doing a project in which i need to insert data into vectors sort it and search it ... </p>
  
  <p>i need fastest possible algorithms for sort and search ... i've been searching and found out that std::sort is basically quicksort which is one of the fastest sorts but i cant figure out which search algorithm is the best ? binarysearch?? can u help me with it? tnx ... So i've got 3 methods:</p>
  
  <pre><code>void addToVector(Obj o)
  {
    fvector.push_back(o);
  }
  
  void sortVector()
  {
    sort(fvector.begin(), fvector().end());
  }
  
  Obj* search(string&amp; bla)
  {
   //i would write binary search here
   return binarysearch(..);
  }
  </code></pre>