 task like sorting that does a lot of rearrangement gains a distinct advantage when operating on a linked list instead of an array.</p>

<p>Your task for this part of the assignment is to write two different routines to rearrange the nodes of a linked list into sorted order. The first uses a run-based merging sort and the second is an implementation of the classic Quicksort algorithm. This exercise will give you great practice with pointers and linked structures and deepen your understanding of sorting algo