Review of quicksort
Given an array b[0..k]
- if b.length = 1, done
- if b.length = 2, then swap if necessary, done.
- partition the array around b[0], suppose value in b[0] ends up in position j
- quicksort b[0..j-1]
- quicksort b[j+1..k]
This version of quicksort is recursive (calls itself)