Skip Navigation

The Computer Journal 1988 31(3):283-284; doi:10.1093/comjnl/31.3.283
© 1988 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 (7)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Er, M. C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Fast Algorithm for Generating Set Partitions

M. C. Er *

Department of Computer Science, The University of Western Australia, Nedlands, WA 6009, Australia

A recursive algorithm for generating all partitions of the set {1, 2, ..., n} is presented. The average time complexity per partition generated of this algorithm is {theta}(1.6). This algorithm runs faster than the previously fastest algorithm, whose average time complexity per partition is {theta}(4). An empirical test confirms that this is indeed the case.

Received January 1987.

* Department of Computer Science, The University of Western Australia, Nedlands, W A6009, Australia


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




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.