Randomize a List Into Random Order

It uses the Fisher-Yates shuffle, the standard algorithm for randomly reordering a list. It walks through the items once and swaps each with a randomly chosen earlier item, so every possible order is equally likely.

It is fair. Fisher-Yates gives every permutation the same probability when the random source is unbiased, so no item is favored to land first, last, or anywhere in particular.

Common uses include putting names in a random order for draws or giveaways, deciding turn order, randomizing a playlist or task list, picking a study order, and shuffling questions or test data.

It uses your browser's built-in random number generator, which is suitable for everyday tasks like draws and ordering. It is not cryptographically secure, so do not rely on it for security-sensitive randomness.

Duplicate lines are all kept and shuffled like any other item, so a list of three identical entries still returns three. Blank lines and surrounding spaces are trimmed away before shuffling so they do not create empty entries.

Yes. The shuffle runs entirely in your browser and nothing is uploaded to a server.