How does the text shuffler work?

We use the Fisher-Yates shuffle algorithm, a mathematically proven method ensuring every possible permutation is equally likely. This provides truly unbiased random ordering.

Can I use this to pick a random winner?

Yes. Paste your list of names and click Shuffle. The top result is your winner. For multiple winners, take the first N lines. It's transparent and fair for raffles and giveaways.

Does this tool remove duplicates before shuffling?

By default, no—duplicates stay and have proportionally higher chances. Enable "Remove duplicates first" if you need each entry to have equal probability.

Is the randomization truly random?

For practical purposes, yes. We use your browser's cryptographic random number generator (crypto.getRandomValues) which provides sufficient entropy for games, studying, and data testing.

Can I shuffle multiple times and get different results?

Yes. Each shuffle produces a new random order. Click Shuffle repeatedly to generate different permutations. Use "Shuffle History" to compare previous results.

What is the Cut-up technique?

A creative writing method popularized by William Burroughs. You shuffle sentences or phrases to create unexpected combinations and spark new ideas. This tool is perfect for that experiment.

List Randomizer & Line Shuffler

Mix up your list with zero bias using the Fisher-Yates algorithm

Enter your list (one item per line)

Total Lines

Unique Lines

Times Shuffled

Permutations

Options

Remove duplicates first Remove empty lines Number results

Pick Winners

Select top line(s) as winner(s)

Shuffled Result

Shuffle History

Previous shuffle results will appear here...

Why Shuffle Your Text?

Need to pick a winner, mix up quiz questions, or break writer's block? Our shuffler uses a professional algorithm to instantly randomize your list with zero bias.

For Teachers

Prevent cheating by creating different test versions. Paste your questions, shuffle, and print unique copies. Students can't share answers when everyone has different question orders.

For Developers

Test how your application handles unsorted data. Generate random test cases. Verify sorting algorithms work correctly regardless of input order.

For Creatives

Try the Cut-up technique popularized by William Burroughs and David Bowie. Shuffle sentences to find accidental poetry or break creative blocks with unexpected combinations.

Fisher-Yates Algorithm

The gold standard for unbiased shuffling:


for (let i = arr.length - 1; i > 0; i--) {

  const j = Math.floor(Math.random() * (i + 1));

  [arr[i], arr[j]] = [arr[j], arr[i]];

}

Each element has equal probability of ending up in any position.