SciELO - Scientific Electronic Library Online

 
vol.7 issue3Algebraic theory for the clique operatorOn the homotopy type of the clique graph author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

Share


Journal of the Brazilian Computer Society

Print version ISSN 0104-6500On-line version ISSN 1678-4804

Abstract

ITAI, Alon. Generating permutations and combinations in lexicographical order. J. Braz. Comp. Soc. [online]. 2001, vol.7, n.3, pp.65-68. ISSN 0104-6500.  http://dx.doi.org/10.1590/S0104-65002001000200009.

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.

Keywords : Permutations; combinations; amortized complexity.

        · text in English     · English ( pdf epdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License