Expected Comparisons in Randomized Quicksort

In randomized quicksort, a pivot is chosen uniformly at random at each recursive call. For an array of $n$ distinct elements, find the exact expected number of comparisons. Express your answer as a sum involving harmonic numbers.