title: Is std::sort optimized for sorting small amount of items too?
body: <p>There is an algorithm to sort 5 items in 7 comparisons: <a href="https://stackoverflow.com/questions/1534748/design-an-efficient-algorithm-to-sort-5-distinct-keys-in-fewer-than-8-comparison">Design an efficient algorithm to sort 5 distinct keys in fewer than 8 comparisons</a>
  Does <code>std::sort()</code> use that algorithm if it is called for 5 items?
  Can this algorithm be extended to 7 items? What is the fastest algorithm for sorting 7 integers in C/C++?</p>