Cyclic Permutations: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
(One intermediate revision 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 27: Line 27:


[[File:Generating Random Permutations - Cyclic Permutations - Time.png|1000px]]
[[File:Generating Random Permutations - Cyclic Permutations - Time.png|1000px]]
== Space Complexity Graph ==
[[File:Generating Random Permutations - Cyclic Permutations - Space.png|1000px]]
== Time-Space Tradeoff ==
[[File:Generating Random Permutations - Cyclic Permutations - Pareto Frontier.png|1000px]]

Latest revision as of 09:07, 28 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

Error creating thumbnail: Unable to save thumbnail to destination