Algorithms/Combinatorics

Notes

Knuth AOCP Volume 3 Sorting and Searching

5.1 Combinatorics

Knuth begins talking about sorting by talking about combinatorics and permutations of items.

Start with definition of an inversion:

Let $ a_1 a_2 a_3 \dots a_n $ be a permutation of the integers $ {1 \dots n} $.

If $ i < j $ and $ a_i > a_j $, then $ (a_i, a_j) $ is an inversion.

Inversions are out-of-sorts pairs.

Cramer (1750) introduced inversions - utilized to find determinant.

Can also construct an inversion table:

Let $ b_1 b_2 \dots b_n $ denote the inversion table of $ a_1 a_2 \dots a_n $. Then $ b_j $ is the number of elements to the left of j that are greater than j.

Example of sequence and its inversion table:

5 9 1 8 2 6 4 7 3
2 3 6 4 0 2 2 1 0

$ 0 \leq b_1 \leq n-1, 0 \leq b_2 \leq n-2, \dots, 0 \leq b_{n-1} \leq 1 $

Hall (1956) showed that inversion tables uniquely determine permutations - these make inversion tables alternative representations for different permutations.

Transformation technique: turn counting problems into inversion table problems

Now, suppose we want to count number of elements larger than their successor. (This is the number of j such that $ b_j = n-j $).

Note that this idea is related to nested for loops:

for(int i = 0; i < N; i++ ) {
    for(int j = i; j < N; j++) { 

We have $ b_j = n - j $

Since we know the probability that b1 equals n-1 is $ P(b_1 = n-1) = \frac{1}{n} $,

and independently the probability that b2 equals n-2 is $ P(b_2 = n-2) = \frac{1}{n-1} $,

and so on, then we can say:

$ \dfrac{1}{n} + \dfrac{1}{n-1} + \dots + 1 = H_{n} $

These are the harmonic numbers.

Now, to analyze a sorting algorithm, we are interested in how many permutations of n elements have exactly k inversions. Number of inversions is denoted I, so this number is denoted $ I_n(k) $

To pose this problem slightly differently: we can think of $ I_n(k) $ as a number that is produced by some kind of generating function into which we plug our n and our k, and out pops $ I_n(k) $.

In fact, we can do this by defining an infinite series polynomial whose kth coefficient is precisely $ I_n(k) $.

Also note that $ I_n = \left( \binom{n}{2} - k \right) = I_n(k) $.

We define the generating function $ G_n(z) $ for a sequence containing n elements as:

$ G_n(z) = I_n(0) + I_n(1)z + I_n(2) z^2 + \dots = \sum_{k \geq 0} I_n(k) z^k $

Now, we know that when we choose a particular item b as the next element of our sequence $ b_1 b_2 b_3 \dots b_n $, that choice is independent of all other b's. Another thing we can observe is, there are two possible ways (two possible cases) for a sequence with n elements and k inversions:

• Either we take a sequence of length n-1 and k inversions, and add an item to it that does not change k;
• Or, we take a sequence of length n and k-1 inversions, and we change an item such that we add an inversion k.

From these, we can construct the recursive relationship:

$ I_n(k) = I_n(k-1) + I_{n-1}(k) \qquad \mbox{for } k < n $