<span class="p">(</span><span class="n">ListNode</span><span class="o">*&amp;</span> <span class="n">list</span><span class="p">);</span>
<span class="kt">void</span> <span class="nf">quickSort</span><span class="p">(</span><span class="n">ListNode</span><span class="o">*&amp;</span> <span class="n">list</span><span class="p">);</span>
</code></pre></div></div>
<p>Each rearranges the nodes of list into sorted order. The first implements a run-based merging sort and the second implements a classic Quicksort 