AOCP/Combinatorial Algorithms
From charlesreid1
Knuth Volume 4A
In Volume 4A of The Art of Computer Programming, Knuth introduces several combinatorial algorithms that are for generating permutations.
These are listed below, with links to coverage of the topic on other charlesreid1.com wiki pages.
Algorithm M: Mixed Radix Add-One Permutation Gen Algorithm
AOCP/Generating_Permutations_and_Tuples#Add-One_Mixed_Radix_Generation_Agorithm
Algorithm G: Gray Code Permutation Gen Algorithm
AOCP/Generating_Permutations_and_Tuples#Gray_Binary_Code_Generation_Algorithm
Algorithm L: Cool Lexicographic Order Permutation Gen Algorithm
Flags
 |
The Art of Computer Programming notes from reading Donald Knuth's Art of Computer Programming
Part of the 2017 CS Study Plan.
Mathematical Foundations: AOCP/Infinite Series · AOCP/Binomial Coefficients · AOCP/Multinomial Coefficients AOCP/Harmonic Numbers · AOCP/Fibonacci Numbers Puzzles/Exercises:
Volume 2: Seminumerical Algorithms
Volume 3: Sorting and Searching AOCP/Combinatorics · AOCP/Multisets · Rubiks Cube/Permutations
AOCP/Combinatorial Algorithms · AOCP/Boolean Functions AOCP/Five Letter Words · Rubiks Cube/Tuples AOCP/Generating Permutations and Tuples
|
 |
Combinatorics
Combinatorial Structures - Order Does Not Matter Ordinary generating functions
Labelled Structures - Order Matters Enumerating Permutations: String Permutations Generating Permutations: Cool · Algorithm M (add-one) · Algorithm G (Gray binary code)
Combinatorics Problems Longest Increasing Subsequence · Maximum Value Contiguous Subsequence · Racing Gems Cards (poker hands with a deck of 52 playing cards)
|