Quicksort
Quicksort is a popular sorting algorithm. That being the case makes sense that we see how to implement it right? Let’s go then. This algorithm basis itself on divide-and-conquer. For our purposes what that means is that, at each step we will use a pivot and divide our list into two sublists: one with lower values and one with equal or bigger values. Then we sort each sublist. The stopping condition of our algorithm will be when we reach the empty list....