Cyclic Permutations: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "{{DISPLAYTITLE:Cyclic Permutations (Generating Random Permutations)}} == 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 == <pre>n: number of elements</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation...")
 
No edit summary
Line 10: Line 10:
== Parameters ==  
== Parameters ==  


<pre>n: number of elements</pre>
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 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

Generating Random Permutations - Cyclic Permutations - Time.png

Space Complexity graph

Generating Random Permutations - Cyclic Permutations - Space.png

Pareto Decades graph

Generating Random Permutations - Cyclic Permutations - Pareto Frontier.png