The generation of all members of a combinatorial family, such as permutations, partitions of an integer or binary trees with n nodes, has long been of interest in the computer science community. The development of loopless algorithms for such generation has been of more recent concern. This paper is an introduction to the idea and development of loopless algorithms. It illustrates the creation of a number of such algorithms, including multiset permutations, Gray codes and binary trees, and a new one for the generation of Schröder trees.
Loopless Algorithms And SchrÖder Trees
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.