In the Fisher-Yates shuffling algorithm
Fisher-Yates shuffle is a standard shuffle algorithm. Here's the pseudo code:
To shuffle an array a of n elements:
for i from n - 1 downto 0 do
j ← random integer with 0 ≤ j ≤ i
exchange a[j] and a[i]
Here is a simple Java implementation:
static String shuffled(String s) {
char[] a = s.toCharArray();
final int N = a.length;
Random r = new Random();
for (int i = N - 1; i >= 0; i--) {
int j = r.nextInt(i + 1);
swap(a, i, j);
}
return new String(a);
}
static void swap(char[] a, int i, int j) {
char t = a[i];
a[i] = a[j];
a[j] = t;
}
Then you can:
String text = "stackoverflow";
for (int i = 0; i < 10; i++) {
System.out.println(shuffled(text));
}
This will result in 10 line shuffling "stackoverflow"( see also at ideone.com ).
Guava + Java Collections Framework
Guava, . :
, :
import com.google.common.primitives.*;
import java.util.*;
public class AnagramCreator {
public static void main(String[] args) {
String text = "stackoverflow";
char[] arr = text.toCharArray();
List<Character> list = Chars.asList(arr);
for (int i = 0; i < 10; i++) {
Collections.shuffle(list);
System.out.println(new String(arr));
}
}
}
10 "stackoverflow".
, Guava List<Character> char[]. A char[] autoboxed Character[] ( ), Arrays.asList(T...) .
.