GitHub / CorvusCodex / Fisher-Yates-JS
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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CorvusCodex%2FFisher-Yates-JS
PURL: pkg:github/CorvusCodex/Fisher-Yates-JS
Stars: 1
Forks: 0
Open issues: 0
License: mit
Language: JavaScript
Size: 5.86 KB
Dependencies parsed at: Pending
Created at: over 5 years ago
Updated at: about 2 years ago
Pushed at: almost 3 years ago
Last synced at: 27 days ago
Topics: fisher-yates, fisher-yates-shuffle, javascript, javascriptrandom, nodejs, rng