Generating permutations and combinations in lexicographical order

AUTOR(ES)

Itai, Alon

FONTE

Journal of the Brazilian Computer Society

DATA DE PUBLICAÇÃO

2001

RESUMO

We consider producing permutations and combinations in lexicographical order. Except for the array that holds the combinatorial object, we require only O(1) extra storage. The production of the next item requires O(1) amortized time.

Documentos Relacionados

• ASYMPTOTIC NORMALITY OF LINEAR COMBINATIONS OF FUNCTIONS OF ORDER STATISTICS, II*
• Sequence permutations in the molecular evolution of DNA methyltransferases
• BAliBASE (Benchmark Alignment dataBASE): enhancements for repeats, transmembrane sequences and circular permutations
• Preparation and Use of Preconstructed Orders, Order Sets, and Order Menus in a Computerized Provider Order Entry System
• A universal plasmid library encoding all permutations of small interfering RNA