Monthly Archives: June 2011

Shuffling an array

In-Place swapping is a common way to shuffle an array. However, it’s easy to make an implementation mistake. When the size of the array is N, there are N! permutations. The goal is, after the shuffling operation, each permutation shall … Continue reading

Posted in Algorithm | Tagged , , | Leave a comment