The Fisher-Yates (aka Knuth) shuffle for Browser JavaScript and Node.js
Go to file
AJ ONeal 27f1186b2f update urls 2017-10-28 21:54:19 -06:00
.gitignore Initial commit 2013-12-02 23:37:01 -08:00
.jshintrc every js project deserves a jshint 2013-12-03 00:45:50 -07:00
LICENSE Initial commit 2013-12-02 23:37:01 -08:00
README.md update urls 2017-10-28 21:51:44 -06:00
bower.json v1.0.2 2017-10-28 21:51:56 -06:00
example.js initial commit 2013-12-03 00:44:42 -07:00
index.js sniff global as window or global due to new CSP in browser 2014-09-28 02:22:08 -07:00
package.json update urls 2017-10-28 21:54:19 -06:00

README.md

knuth-shuffle

The Fisher-Yates (aka Knuth) shuffle for Browser and Node.js

'nuf said.

The Fisher-Yates (Knuth) Shuffle

As Microsoft learned the hard way (see article below), function random() { return 0.5 - Math.random() } turns out to be no-so-random at all.

The fisher-yates shuffle is an algorithm so simple that even IEEE floating point math can't screw it up!

I put this on npm as knuth-shuffle because fisher-yates-shuffle was just too long of a name and shuffle was already taken.

Browser Example

<script src="https://raw.github.com/coolaj86/knuth-shuffle/master/index.js"></script>
(function () {
  'use strict';

  var a = [2,11,37,42];
  var b;

  // The shuffle modifies the original array
  // calling a.slice(0) creates a copy, which is assigned to b
  b = window.knuthShuffle(a.slice(0));
  console.log(b);
}());

Node Example

Decentralized Install

npm install --save git+https://git.coolaj86.com/coolaj86/knuth-shuffle.js.git#v1.0

Centralized Install

npm install --save knuth-shuffle@1.0
(function () {
  'use strict';

  var shuffle = require('knuth-shuffle').knuthShuffle;
  var a = [2,11,37,42];
  var b;

  // The shuffle modifies the original array
  // calling a.slice(0) creates a copy, which is assigned to b
  b = shuffle(a.slice(0));
  console.log(b);
}());