integer_sort</span><span class="special">(</span><span class="identifier">Range</span> <span class="special">&amp;</span> range<span class="special">)</span><span class="special">;</span></pre></div>
<div class="refsect1">
<a name="idp102399088"></a><h2>Description</h2>
<p><code class="computeroutput">integer_sort</code> is a fast templated in-place hybrid radix/comparison algorithm, which in testing tends to be roughly 50% to 2X faster than <code class="computeroutput">std::sort</code> for large tests (&gt