Array shuffle method using Mike Bostock's Fisher-Yates Shuffle implementation. Original is here: http://bost.ocks.org/mike/shuffle/
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* Extends the primitive Array with a random sort function | |
* | |
* @returns {Array} | |
*/ | |
;Array.prototype.shuffle = function() { | |
var arr = this, | |
m = arr.length, | |
t, | |
i; | |
// 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