Quicksort

Quick sort is usually implemented recursively.

Algorithm
  Pick a "pivot point". {Picking a "good" pivot point can affect the running time, but don't ask me to explain.}   break the list into two lists: those elements less than the pivot element, and those elements greater than the pivot element.   recursively sort each of the smaller lists   make one big list: the 'smallers' list, the pivot points, and the 'biggers' list  