Skip Navigation

The Computer Journal 1980 23(4):332-337; doi:10.1093/comjnl/23.4.332
© 1980 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (11)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Fenner, T. I.
Right arrow Articles by Loizou, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A binary tree representation and related algorithms for generating integer partitions

T. I. Fenner * and G. Loizou *

Department of Computer Science, Birkbeck College, University of London, Malet Street, London, UK

A representation of the partitions of an integer as a binary tree is presented, and the structure of this tree is related to the lexicographic ordering of the set of partitions. The appropriate recursive traversal algorithm for this binary tree immediately yields a recursive algorithm for generating the set of partitions in lexicographic order. Further consideration of the structure of the tree enables us to transform this version of the algorithm into a non-recursive loop-free version. Similar consideration of another recursive traversal algorithm yields corresponding algorithms for generating the set of partitions in a different order.

Received April 1979.

* Department of Computer Science, Birkbeck College, University of London, Malet Street, London WC1E 7HX


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 IEICE Trans FundamentalsHome page
K. YAMANAKA, S.-i. KAWANO, Y. KIKUCHI, and S.-i. NAKANO
Constant Time Generation of Integer Partitions
IEICE Trans A: Fundamentals, May 1, 2007; E90-A(5): 888 - 895.
[Abstract] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.