quicksort(A,p,r)
  if p < r
    // Partition the subarray around the pivot, which ends up in A[q].
    q = partition(A,p,r)
    quick_sort(A,p,q-1)
    quick_sort(A,q+1,r)