Quick-sort (11)
static int partition ( Comparable[] a, int left, int right) {// Partition a[left…right] such that // a[left…p-1] are all less than or equal to a[p], and // a[p+1…right] are all greater than or equal to a[p]. // Return p. Comparable pivot = a[left]; int p = left;