[Basis of algorithm design and analysis] 4. pseudo-random number, algorithm design and analysis
Package cn. xf. algorithm. ch02; import java. util. arrayList; import java. util. list; /*** generate Random number * @ author xiaof **/public class Random {/*** generate a Random number series * @ param n generate n Series * @ param m data in * @ param seed random initial seed * @ M-1 am a parameter * @ param B parameter * @ return */public static List <Integer> randomNum (int n, int m, int seed, int a, int B) {List <Integer> numbers = new ArrayList <Integer> (); int initData = (a * seed + B) % m; numbers. add (Math. abs (initData); // initialize a data for (int I = 1; I <n; ++ I) {int newData = (a * numbers. get (I-1) + B) % m; numbers. add (Math. abs (newData);} return numbers;} public static void main (String [] args) {List <Integer> res = Random. randomNum (10, 10,998,587 97676, 1); for (int a: res) {System. out. print (a + "\ t ");}}}
Result: