aboutsummaryrefslogtreecommitdiffstats
path: root/src/algorithms/shuffling/KnuthShuffle.java
blob: 7414e491c77445f46139f757e057be2cc4f6183f (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
/**
 * Copyright © 2014  Mattias Andrée (maandree@member.fsf.org)
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Affero General Public License for more details.
 * 
 * You should have received a copy of the GNU Affero General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package algorithms.arrays;

import java.util.Random;


/**
 * Bias free array shuffling class using Knuth Shuffle.<br>
 * Sattolo Cycle is an improvement of this method.
 */
public class KnuthShuffle
{
£>for T in boolean char byte short int long float double Object; do
    /**
     * Shuffles an array
     *
     * @param  array   The array to shuffle
     * @param  random  The random generator to use
     */
    public static void shuffle(£{T}[] array, Random random)
    {
        int i = 0, j;
        int n = array.length - 1;
        for (;;)
	{
	    if (i == n)
		break;
            
	    £{T} temp = array[i];
	    array[i] = array[j = random.nextInt(n - i) + i + 1];
	    array[j] = temp;
            
	    i++;
	}
    }
£>done
}