Jump to content

Heap's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Pengfeituan (talk | contribs) at 02:52, 23 December 2013 (←Created page with 'Heap's permutation Generation Algorithm is an algorithm for generating permutation. It was first proposed by B. R. Heap in 1963<ref>{{cite journal|last=Heap|firs...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Heap's permutation Generation Algorithm is an algorithm for generating permutation. It was first proposed by B. R. Heap in 1963[1] .

References

  1. ^ Heap, B. R. (1963). "Permutations by Interchanges" (PDF). The Computer Journal. 6 (3): 293-4.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Heap%27s_algorithm&oldid=587317841"