# AOCP/Combinatorial Algorithms

### From charlesreid1

## Contents

## 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 ProgrammingArt of Computer Programming
Part of the 2017 CS Study Plan.
Mathematical Foundations: AOCP/Infinite Series AOCP/Harmonic Numbers Puzzles/Exercises:
AOCP/Combinatorics
AOCP/Combinatorial Algorithms AOCP/Five Letter Words AOCP/Generating Permutations and Tuples
· Template:AOCPFlag · e |

Combinatorics
Ordinary generating functions
Enumerating Permutations: String Permutations Generating Permutations: Cool
Longest Increasing Subsequence Cards (poker hands with a deck of 52 playing cards)
· Template:CombinatoricsFlag · e |