random-permutations
Here are 6 public repositories matching this topic...
Language:All
A Rust library for iterating over random permutations.
- Updated
Jun 15, 2021 - Rust
Implementation of a Generalized-Feistel Cipher for generating random permutations.
- Updated
Dec 1, 2025 - C
🔀 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.
- Updated
Aug 11, 2023 - JavaScript
Melbourne C++ Meetup materials
- Updated
May 11, 2020 - C++
First AED Project - Algorithms to solve a problem in C using different methods (brute force, branch-and-bound, random permutations)
- Updated
Aug 16, 2022 - C
An efficient random item sampler that ensures O(1) sampling complexity, and equal selection probability for all items across cycles. Each cycle ensures unique, non-repeating item selections, with each item sampled only once per cycle. Upon cycle completion, the sampler automatically refreshes, initiating a new cycle to repeat the process.
- Updated
Nov 10, 2024 - TypeScript
Improve this page
Add a description, image, and links to therandom-permutations topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with therandom-permutations topic, visit your repo's landing page and select "manage topics."