Tompkins–Paige algorithm (All Permutations All Permutations)

From Algorithm Wiki

Revision as of 09: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)$ 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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Tompkins–Paige_algorithm_(All_Permutations_All_Permutations)&oldid=47371"