Heap's algorithm (All Permutations All Permutations)

From Algorithm Wiki

Revision as of 08:41, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n)$ per permutation

Space Complexity

$O(n)$ words

($O(n)$-sized stack or array necessary)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1963

Reference

https://academic-oup-com.ezproxy.canberra.edu.au/comjnl/article/6/3/293/360213

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Heap%27s_algorithm_(All_Permutations_All_Permutations)&oldid=47372"