ss="refsect1">
<a name="idm5045"></a><h2>Description</h2>
<p>(All variants fall back to <code class="computeroutput">boost::sort::pdqsort</code> if the data size is too small, &lt; <code class="computeroutput">detail::min_sort_size</code>).</p>
<p><code class="computeroutput">string_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;=100kB).<br>
</p>
<p><b> 