========== Algorithms ========== Sorting Algorithms ================== Quicksort --------- partition array around pivot element less than pivot go before greater than pivot go after QuickSort(array a, length n) if n = 1 return p = choosePiviot(A,n) Partiion A around p [p]