Cyclic Permutations: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
n: number of elements | $n$: number of elements | ||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 07:52, 10 April 2023
Description
Given an input string/array, generate a single random cyclic permutation of the characters/elements of the string/array.
Related Problems
Related: General Permutations
Parameters
$n$: number of elements
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Sattolo's algorithm | 1986 | $O(n)$ | $O({1})$ | Exact | Randomized | Time |
Time Complexity Graph
Space Complexity Graph
Time-Space Tradeoff
