 choosing the first element of the input list as the pivot value and prepare three empty sublists.</li>
      <li>Traverse the input list and examine each node to determine which sublist to move the node to, i.e. is value strictly less than the pivot, equal to the pivot, or strictly greater that pivot?</li>
      <li>It does not matter what order you put the elements into the sublists, so when moving nodes, choose the simplest strategy! The easiest place to add a node to a linked list is to the front.</li>
