BIROn - Birkbeck Institutional Research Online

    An analysis of two related loop-free algorithms for generating integer partitions

    Fenner, Trevor and Loizou, G. (1981) An analysis of two related loop-free algorithms for generating integer partitions. Acta Informatica 16 , pp. 237-252. ISSN 0001-5903.

    Full text not available from this repository.

    Abstract

    Two loop-free algorithms, LEX and NEXPAR2, for generating the partitions of a positive integer n, in lexicographic and antilexicographic order, respectively, are investigated, and their structures are shown to be closely related. By utilising a number of combinatorial identities which relate the cardinalities of various classes of partitions, we derive formulae from which operation counts for the two algorithms may be obtained. For large n, corresponding asymptotic formulae are also obtained. A number of modifications and refinements of the two algorithms are discussed, and the relative performance of the algorithms resulting, and also the original algorithms, is analysed for both the non-asymptotic and the asymptotic cases.

    Metadata

    Item Type: Article
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 23 Mar 2021 19:52
    Last Modified: 23 Mar 2021 19:52
    URI: https://eprints.bbk.ac.uk/id/eprint/43636

    Statistics

    Activity Overview
    6 month trend
    0Downloads
    6 month trend
    52Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item