Heap's algorithm
id:
heap-s-algorithm-286-17946820
title:
Heap's algorithm
text:
Heap's algorithm generates all possible permutations of n objects. It was first proposed by B. R. Heap in 1963. The algorithm minimizes movement: it generates each permutation from the previous one by interchanging a single pair of elements; the other n−2 elements are not disturbed. In a 1977 review of permutation-generating algorithms, Robert Sedgewick concluded that it was at that time the most effective algorithm for generating permutations by computer. The sequence of permutations of n objec
brand slug:
wiki
category slug:
encyclopedia
description:
Method of generating all permutations of n objects
original url:
https://en.wikipedia.org/wiki/Heap%27s_algorithm
date created:
date modified:
2024-01-01T02:25:20Z
main entity:
{"identifier":"Q16907296","url":"https://www.wikidata.org/entity/Q16907296"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/da/Wheel_diagram_Heap%27s_algorithm.svg","width":250,"height":250}
fields total:
13
integrity:
15