Abstract: The paper describes the algorithms of consecutive generation, numbering and generation according to number of limited partitions. Algorithms are constructed on the basis of use of the tree of partitions received by means of a recurrent formula. We analyzed the offered algorithms and compared them with the known ones.
Keywords: algorithm, generation, partition of natural number, numeration, time complexity
For citation:
Perminova M. Yu., Kruchinin V. V. Recursive generation algorithms of limited partitions of natural number. Doklady Tomskogo gosudarstvennogo universiteta sistem upravleniya i radioelektroniki, 2014, no. 4(34), pp. 89–94.
Authors and copyright holders:
- Perminova M. Yu.
- Kruchinin V. V. , Tomsk State University of Control Systems and Radioelectronics (Tomsk, Russia)
—
Last issue
-2026-1_%D0%BA%D0%BE%D0%BF%D0%B8%D1%8F.jpg)
Editorial office address
Executive Secretary of the Editor’s Office
Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia
Phone / Fax: + 7 (3822) 701-582
Viktor N. Maslennikov
Executive Secretary of the Editor’s Office
Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia
Phone / Fax: + 7 (3822) 51-21-21 / 51-43-02
Subscription for updates
