Skip to content

Instantly share code, notes, and snippets.

What would you like to do?
Array shuffle method using Mike Bostock's Fisher-Yates Shuffle implementation. Original is here:
* Extends the primitive Array with a random sort function
* @returns {Array}
;Array.prototype.shuffle = function() {
var arr = this,
m = arr.length,
// While there remain elements to shuffle…
while ( m ) {
// Pick a remaining element…
i = Math.floor( Math.random() * m-- );
// And swap it with the current element.
t = arr[ m ];
arr[ m ] = arr[ i ];
arr[ i ] = t;
return arr;
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.