algorithm.</p>

<h3 id="runsort">RunSort</h3>
<p><strong>RunSort</strong> is an algorithm based on continuously merging sorted runs, building the result from the bottom-up. The result list is initially empty and thus trivially sorted.  The algorithm splits one sorted run from the input and merges it into the result. Then again: split another run from input and merge with the result. The process repeats until the remaining input is empty and result contains the final list.</p>

<p>Linked lists are a great fi