Durstenfeld's Algorithm 235 (General Permutations Generating Random Permutations)
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