Reorder every list row without dropping items
Use the shuffler when you need a full random order rather than one winner. The output contains the same valid rows exactly once, arranged in a newly sampled permutation.
Concrete input and output example
Paste Draft, Review, Approve, Publish. One run might return Review, Publish, Draft, Approve; all four tasks remain, but their positions change.
How the result is produced
The tool copies the normalized rows and runs Fisher–Yates from the final position toward the first. Each swap index is selected uniformly with Web Crypto entropy.
Limits and checks
- At least two valid rows are required and at most 500 are retained.
- Identical labels are separate rows, so the output can visibly contain duplicates.
- Random order does not account for dependencies, priority, deadlines, or accessibility constraints.
Local data boundary
The source list is processed locally and may persist in this browser's localStorage. Shuffled output stays on the current page until copied or replaced.
Questions about this tool
- Does shuffling change my input box?
- No. The randomized order appears as output while the saved source order remains available.
- Can an item remain in its original position?
- Yes. A uniform shuffle permits fixed points; random does not mean every row must move.
- Are all possible orders equally likely?
- For distinct rows, the implemented unbiased Fisher–Yates process gives each permutation the same probability.
Content and implementation reviewed: