Quick Sort

how to partition around a pivot, choose pivot strategies to avoid worst-case O(n^2), and why cache efficiency makes quicksort the default in most libraries