Heap's algorithm: Difference between revisions

Revision as of 00:31, 26 January 2014

Revision as of 04:26, 26 January 2014

Line 1:

{{Copy edit|date=December 2013}}

'''Heap's algorithm''' is an [[algorithm]] used for generating [[permutation]]s. It was first proposed by B. R. Heap in 1963.<ref>{{cite journal|last=Heap|first=B. R.|title=Permutations by Interchanges|journal=The Computer Journal|year=1963|volume=6|issue=3|pages=293–4|url=http://comjnl.oxfordjournals.org/content/6/3/293.full.pdf}}</ref> It interchanges the positions of elements to generate the proceedingnext permutation. In a 1977 review of permutation-generating algorithms, [[Robert Sedgewick (computer scientist)|Robert Sedgewick]] concluded that it was the most effective algorithm for then-current computers.<ref>{{cite doi|10.1145/356689.356692}}</ref>

== Details of the algorithm ==