Tompkins–Paige algorithm (All Permutations All Permutations)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n)$ on specific permutations

Space Complexity

$O(n)$ words

(Keeps track of auxiliary counting array)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1956

Reference

https://mathscinet.ams.org/mathscinet-getitem?mr=0080380