<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="C++ Standard Library - Page 6 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=C++_Standard_Library&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=C%2B%2B_Standard_Library&amp;p=7">3.Next</a>
</p>
<p>system.</p>

<p>A noteworthy feature of the C++ Standard Library is that it not only specifies the syntax and semantics of generic algorithms, but also places requirements on their performance. These performance requirements often correspond to a well-known algorithm, which is expected but not required to be used. In most cases this requires linear time O(n) or <a href="page.php?w=linearithmic_time">linearithmic time</a> O(n log n), but in some cases higher bounds are allowed, such as <a href="page.php?w=quasilinear_time">quasilinear time</a> O(n</p><p>
<a accesskey="1" href="page.php?w=C++_Standard_Library&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=C%2B%2B_Standard_Library&amp;p=7">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
