>, the final step is to put them together into <code class="language-c++ highlighter-rouge"><span class="n">quickSort</span></code>.  Partition the input list into three sublists. Make recursive calls to <code class="language-c++ highlighter-rouge"><span class="n">quickSort</span></code> on the less and greater sublists. (The equal sublist is already trivially sorted.) Concatenate the three sorted sublists into the final result. The last detail for you to work out is an appropriate base case. Then your Quic