Line shuffler for huge text file which does not fit in memory

Simulation of car parking in different parking lots using Unity ML-Agents

Triple Data Encryption Standard

A small data structures library for JavaScript

Algorithm to generate football match fixtures (Data Structures and Algorithms Term Project)

The Fisher–Yates shuffle is an algorithm for generating a random permutation of a finite sequence—in plain terms, the algorithm shuffles the sequence. The algorithm effectively puts all the elements into a hat; it continually determines the next element by randomly drawing an element from the hat until no elements remain. The algorithm produces an unbiased permutation: every permutation is equally likely. The modern version of the algorithm is efficient: it takes time proportional to the number of items being shuffled and shuffles them in place. The Fisher–Yates shuffle is named after Ronald Fisher and Frank Yates, who first described it, and is also known as the Knuth shuffle after Donald Knuth. A variant of the Fisher–Yates shuffle, known as Sattolo's algorithm, may be used to generate random cyclic permutations of length n instead of random permutations.

Fisher–Yates Shuffle: Random Permutation Algorithm (Java). The program shuffles the song names in the input text file, and outputs the shuffled into new text file.

Secure implementations permutation sampling algorithms

🎡 Play with algorithms and watch it run step by step. 😀

A Next.js-powered divination app using dual-source entropy (Random.org API + Fisher-Yates shuffle) with TypeScript, TailwindCSS, and Web Speech API integration.

Bogobogosort implementation in node.js

A JavaScript utility for shuffling arrays

Go package with 6 popular shuffling algorithms

Basic Git learning app designed using gamification method and Fisher-Yates Shuffle algorithm

Shuffle an array

The Fisher–Yates shuffle is an algorithm for generating a random permutation of a finite sequence—in plain terms, the algorithm shuffles the sequence. The algorithm effectively puts all the elements into a hat; it continually determines the next element by randomly drawing an element from the hat until no elements remain. The algorithm produces an unbiased permutation: every permutation is equally likely. The modern version of the algorithm is efficient: it takes time proportional to the number of items being shuffled and shuffles them in place.

🔀 The standard algorithm for generating a uniformly chosen random permutation. Devised by Ronald Fisher and Frank Yates, modernized by Richard Durstenfeld and popularized by Donald E. Knuth. This version permits Sattolo cycles as well as seeded/keyed shuffles and unshuffles.

Mock library for simulating decks of cards :spades:

Statistical Evaluation Methods

A program in C showcasing Fisher–Yates shuffle algorithm, to shuffle and deal a deck of cards.

Randomized password generation, based on user selected preferences. Algorithm employs Fisher-Yates array to provide a quality shuffle.

AI-Bijo: AI-generated anime character images with interactive web apps.

🃏 Scrambles (rearranges randomly) Strings and Arrays. 🎋

Encryption and decryption application which encrypts files within the given folder (including files in the subfolders of the given folder).

Seminar paper for Fisher-Yates algorithm including implementation in C++

Time-Crunch Sprint: Random Group Generator (2 of 4 series) ~deployed

Basic Java maze generator and solver Built using Java Swing GUI

An application that visualize shuffle and sorting algorithm.

C# Random class provides functionality to generate random numbers in C#. The Random class can also generate other data types including strings. In this code example, learn how to create a random number in C#.

Inspired by the ’Harry Potter‘ series, the Voldemort ID Disruptor is a lightweight,easy ID obfuscation and generation tool. It generates randomness variants of strings using various character manipulation logic, including fisher-yates-shuffle, case swapping, custom mapping (e.g., 'm' to 'nn'), numeric conversion, and salt addition.