Best shuffle: Difference between revisions

Line 39:
 
do {
foreachfor (refint ei = len; i > 1; chi--) {
swap(ech[i-1], ch[uniform(0, leni)]);
}
} while(countSamePositions(s, ch, len) > 0);
Anonymous user