aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorMattias Andrée <maandree@operamail.com>2014-01-20 01:13:18 +0100
committerMattias Andrée <maandree@operamail.com>2014-01-20 01:13:18 +0100
commit61478ca2c68ca7f419e29165ede53cb0b8581d44 (patch)
tree31799d33c69fad92befb1212bc94152559be538f
parentadd sattolo shuffle (diff)
downloadalgorithms-and-data-structures-61478ca2c68ca7f419e29165ede53cb0b8581d44.tar.gz
algorithms-and-data-structures-61478ca2c68ca7f419e29165ede53cb0b8581d44.tar.bz2
algorithms-and-data-structures-61478ca2c68ca7f419e29165ede53cb0b8581d44.tar.xz
m
Signed-off-by: Mattias Andrée <maandree@operamail.com>
-rw-r--r--src/algorithms/shuffling/SattoloShuffle.java2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/algorithms/shuffling/SattoloShuffle.java b/src/algorithms/shuffling/SattoloShuffle.java
index d34a334..78ab41d 100644
--- a/src/algorithms/shuffling/SattoloShuffle.java
+++ b/src/algorithms/shuffling/SattoloShuffle.java
@@ -23,7 +23,7 @@ import java.util.Random;
* Bias free array shuffling class using Sattolo Cycles.<br/>
* The is probably the best possible shuffling algorithm.
*/
-public class KnuthShuffle
+public class SattoloShuffle
{
£>for T in boolean char byte short int long float double Object; do
/**