General Permutations: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
n: number of elements | $n$: number of elements | ||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 31: | Line 31: | ||
[[File:Generating Random Permutations - General Permutations - Time.png|1000px]] | [[File:Generating Random Permutations - General Permutations - Time.png|1000px]] | ||
Latest revision as of 09:07, 28 April 2023
Description
Given an input string/array, generate a single random permutation of the characters/elements of the string/array.
Related Problems
Related: Cyclic Permutations
Parameters
$n$: number of elements
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Fisher–Yates/Knuth shuffle | 1938 | $O(n^{2})$ | $O(n)$ | Exact | Randomized | Time |
| Durstenfeld's Algorithm 235 | 1964 | $O(n)$ | $O({1})$ | Exact | Randomized | Time |
| Radix sorting method | 1887 | $O(n)$ | $O(n)$ | Exact | Randomized |
Time Complexity Graph
