Search results
22 packages found
The Fisher-Yates (aka Knuth) shuffle for Node.js, with seeding support
A compact module to randomly sort an Array
An implementation of the Durstenfeld algorithm for shuffling collections.
A fast implementation of a fisher-yates shuffle that does not mutate the source array.
Cryptographically secure shuffle using the Fisher-Yates algorithm. The browser's (or NodeJS) crypto services are used to generate strong random numbers.
Javascript versions of classic software development algorithms
- algorithms
- dataStructures
- binaryHeap
- binarySearchTree
- bst
- linkedList
- maxHeap
- minHeap
- queue
- stack
- stackQueue
- trie
- permutation
- shuffle
- View more
Customizable Fisher-Yates shuffle
Cryptographically secure shuffle using the Durstenfeld algorithm with a CSPRNG.
Unsorts (shuffles) arbitrary array
A set of math utilities for working with random numbers/arrays.
Fisher-Yates Shuffle Implementation
fisher-yates shuffle for immutable.js lists
The shuffling algorithm that DOES NOT use Math.random()
A JavaScript utility for shuffling arrays
The Fisher-Yates (aka Knuth) shuffle for Browser and Node.js
Invertible transformations on permutation representations, including an RNG-free in-place Fisher-Yates-Knuth shuffle
- base
- factoradic
- factorial
- Fisher-Yates
- Fisher-Yates-Knuth
- in-place
- Knuth
- number
- permutation
- permutations
- permute
- shuffle
- system
Fisher-Yates shuffle of an array of items.
cryptographically-secure random shuffle of array entries with the Fisher-Yates algorithm
Fisher-Yates for shuffle array and matrix