Counting Quicksort Comparisons on a Fixed-Size Array

On an array of size n, Quicksort's comparison count is a random quantity ranging from n*log n (best) to n(n-1)/2 (worst), determined entirely by how each pivot splits its subarray.