O'Reilly logo

Art of Computer Programming, Volume 4A, The: Combinatorial Algorithms, Part 1 by Donald E. Knuth

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

where each φj and ψj is a string of length Image, the next sequences are

Image

For example, we have Δ3 = 0 1 0 2 1 0 1 and E3 = 0 2 1 2 0 2 1, if we underline the a’s and b’s to distinguish them from the φ’s and ψ’s; and

Image

here a3φ4 and b3ψ4 are empty. Elements have been underlined for the next step.

Thus we can compute the delta sequences in memory as follows. Here p[j] = jπn for 1 ≤ j < n; sk = δk, tk = εk, and uk = [δk and εk are underlined], for 0 ≤ k < 2 ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required