<h2 id="std::cout-and-std::cerr"><a href="https://en.cppreference.com/w/cpp/io/cout">std::cout</a> and <a href="https://en.cppreference.com/w/cpp/io/cerr">std::cerr</a><a class="anchor-link" href="#std::cout-and-std::cerr">¶</a></h2><ul>
<li>To use the <strong>std::cout</strong>, <strong>std::cerr</strong>, <strong>std::endl</strong>, <strong>std::flush</strong> features of the STL you have to include <strong>iostream</strong></li>
<li>The object <a href="https://en.cppreference.com/w/cpp/io/cout">std::cout</a> can be used to output things to screen via the so-called standard output channel</li>
<h2 id="std::algorithms">std::algorithms<a class="anchor-link" href="#std::algorithms">¶</a></h2><p>There are many <a href="https://en.cppreference.com/w/cpp/algorithm">STL algorithms</a> available.</p>
<p>For instance three of them are presented below:</p>
<ul>
<li><a href="https://en.cppreference.com/w/cpp/algorithm/find">std::find</a> searches for a match in a container in $O(N)$ advances</li>
<li><p><a href="https://en.cppreference.com/w/cpp/algorithm/sort">std::sort</a> sorts a container
in $N*log2(N)$ swaps (which then is not the same for list, vectors)</p>
</li>
<li><p><a href="https://en.cppreference.com/w/cpp/algorithm/binary_search">std::binary_search</a> searches into a sorted container in $O(log2(N))$ advances
(which is then long for non random access iterators like lists)</p>
</li>
<li><a href="https://en.cppreference.com/w/cpp/algorithm/set_intersection">std::set_intersection</a> returns the intersection between sets</li>