General Permutations: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:General Permutations (Generating Random Permutations)}} == 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 == <pre>n: number of elements</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor...") |
No edit summary |
||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
n: number of elements | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 12:02, 15 February 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
Space Complexity graph
Pareto Decades graph
