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}
}
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

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Generating permutations with nondistinct

  • T. C. Hu, B. N. Tien
  • items, Amer. Math. Monthly,
  • 1976
Highly Influential
6 Excerpts

A survey of combinatorial Gray codes

  • C Savage
  • SIAM Review,
  • 1997
1 Excerpt

Generation of parenthesis strings by transpositions

  • K. Mikawa, T. Takaoka
  • Proc. the Computing: The Australasian Theory…
  • 1997
2 Excerpts

Similar Papers

Loading similar papers…