Durstenfeld's Algorithm 235 (General Permutations Generating Random Permutations)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ words (Essentially in-situ) == Description == == Approximate? == Exact == Randomized? == Yes, ?? == Model of Computation == Word RAM == Year == 1964 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/364520.364540")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O({1})$ words

(Essentially in-situ)

Description

Approximate?

Exact

Randomized?

Yes, ??

Model of Computation

Word RAM

Year

1964

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/364520.364540

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Durstenfeld%27s_Algorithm_235_(General_Permutations_Generating_Random_Permutations)&oldid=45284"