General Permutations

Given an input string/array, generate a single random permutation of the characters/elements of the string/array.

Parameters

$n$ : number of elements

Related Problems

General Permutations

Cyclic Permutations

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 3 of 3 algorithms

				See more
Durstenfeld's Algorithm 235	1964	$O(n)$	$O(1)$
Fisher–Yates/Knuth shuffle	1938	$O(n^2)$	$O(n)$
Radix sorting method	1887	$O(n)$	$O(n)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table