Skip to content
#

random-permutations

Star

Here are 6 public repositories matching this topic...

Language: All
Filter by language
All 6 C 2 C++ 1 JavaScript 1 Rust 1 TypeScript 1

macmcmeans / fisherYatesDurstenfeldKnuthShuffle

Star 1

🔀 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.

javascript crypto rng shuffle fisher-yates-shuffle vanillajs knuth inside-out method-overloading overloaded-functions uniform-distribution knuth-shuffling-algorithm sattolo sattolo-cycle random-permutations seeded-shuffle durstenfeld unshuffle
  • Updated Aug 11, 2023
  • JavaScript

ori88c / non-replacement-random-item-sampler

Star 0

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.

random constant-time sampling sampler shuffle cycles random-shuffle random-sample rounds random-select random-permutations random-selection random-samples no-repetitions random-item random-selector efficient-sampling non-replacement random-element
  • Updated Nov 10, 2024
  • TypeScript

Improve this page

Add a description, image, and links to the random-permutations topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the random-permutations topic, visit your repo's landing page and select "manage topics."

Learn more