re><div class="info ">
<div class="info-desc">
<p>Same as <a href="List.html#VALsort"><code class="code">List.sort</code></a>, but the sorting algorithm is guaranteed to
   be stable (i.e. elements that compare equal are kept in their
   original order).</p>

<p>The current implementation uses Merge Sort. It runs in constant
   heap space and logarithmic stack space.</p>
</div>
</div>

<pre id="VALfast_sort">val fast_sort : ('a -&gt; 'a -&gt; int) -&gt; 'a list -&gt; 'a list</pre><div class="info ">
<div cl