Random Line Shuffler & List Randomizer

The tool implements the gold-standard Fisher-Yates shuffle algorithm ($O(N)$ time complexity):

$$\text{For } i = n - 1 \text{ down to } 1: \quad j = \text{CSPRNG}(0, i), \quad \text{Swap}(\text{Array}[i], \text{Array}[j])$$

• Unbiased Permutations ($N!$ Combinations): Every possible permutation of the list has an exactly equal probability ($1/N!$) of being selected, eliminating clustering bias.
• Cryptographic Hardware Entropy: Random numbers are generated using crypto.getRandomValues() from the browser's native Web Crypto API, utilizing CPU hardware thermal noise rather than predictable Math.random() pseudo-random seeds.
• Preserves Line Content: Shuffles full lines vertically without modifying internal characters, spaces, or formatting.

• Contests & Raffles: Conducting provably fair random prize drawings from a list of participant names.
• Education & Study Sets: Randomizing flashcards and study question orders to prevent memorizing patterns.
• Machine Learning Data Preparation: Shuffling dataset rows before splitting into training and validation subsets.