Journal ArticleOPEN ACCESS

Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Journal of the ACM (JACM) (1973) 20(3) 500-513
DOI: 10.1145/321765.321781
163Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

The purpose of this work is to find a method for building loopless algorithms for listing combinatorial items, like partitions, permutations, combinations. Gray code, etc. Algorithms for the above sequence are detailed in full. © 1973, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Ehrlich, G. (1973). Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations. Journal of the ACM (JACM), 20(3), 500–513. https://doi.org/10.1145/321765.321781

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free