Algorithm of shuffling algorithm

Shuffle algorithm is our common random problem, in playing games, random sort of often encounter, one of the most common place is the group of volumes. It can be abstracted like this : A random array of all natural numbers within M.

 PackageCom.math;ImportJava.util.Random;/** * @authorSummer **/ Public classShuffle {Static Final int[] A =New int[54]; StaticRandom rnd =NewRandom (); Static{                 for(inti=1;i<55;i++) A[i-1] =i; }        Static voidSwapint[] arr,intIintj) {             intTMP =Arr[i]; Arr[i]=Arr[j]; ARR[J]=tmp; }         Public Static voidShuffle () { for(intI=a.length; i>1; i--) Swap (A, I-1, Rnd.nextint (i)); }         Public Static voidMain (String[]args) {shuffle ();  for(inti:a)        {System.out.println (i); }    }}

Simple implementation, what is the problem everyone to correct.

Algorithm of shuffling algorithm