Ord-Smith ( All permutations)
Jump to navigation
Jump to search
Time Complexity
$O({1})$ per permutation
Space Complexity
$O(n)$ auxiliary words
(O(n)-sized array q (as in paper) necessary)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1967