Highly Influenced

# An O(1) Time Algorithm for Generating Multiset Permutations

@inproceedings{Takaoka1999AnOT, title={An O(1) Time Algorithm for Generating Multiset Permutations}, author={Tadao Takaoka}, booktitle={ISAAC}, year={1999} }

- Published 1999 in ISAAC
DOI:10.1007/3-540-46632-0_25

We design an algorithm that generates multiset permutations in O(1) time from permutation to permutations, using only data structures of arrays. The previous O(1) time algorithm used pointers, causing O(n) time to access an element in a permutation, where n is the size of permutations. The central idea in our algorithm is tree traversal. We associate permutations with the leaves of a tree. By traversing this tree, going up and down and making changes when necessary, we spend O(1) time from… CONTINUE READING