Array Shuffler
GenerationEasyRandomize array elements with Fisher-Yates sorting, supporting deterministic seeds.
Alt+Shift+7
Configuration Panel
1
2
3
4
5
6
7
8
Example Test Cases
Unseeded Random Shuffle
Input 1:false;0;1 2 3 4 5 6 7 8 9 10
Output:Shuffled Array (Random)
Load Case
Seeded Fisher-Yates Shuffle
Input 1:true;1337;1 2 3 4 5 6 7 8 9 10
Output:8 4 9 7 2 5 3 6 1 10 (Deterministic)
Load Case
Complexity Specs
Time ComplexityO(N)
Space ComplexityO(N)
Notes & Tips
- Fisher-Yates (Knuth) Shuffle algorithm guarantees $O(N)$ uniform random distribution.
- Toggling 'Deterministic Seed' produces identical arrays for checking test cases.
- Useful for generating random permutations of nodes, values, or weights.