This is possible by using the shuffle method that allows you to provide the backing Random instance: Collections.shuffle(List<?> list, Random rnd): Example: Collections.shuffle(yourList, new Random(somePredefinedSeed));
If you don’t need the random numbers to be cryptographically secure, you can use a Linear Congruential Generator. An LCG is a formula of the form X_n+1 = X_n * a + c (mod m), it needs constant memory and constant time for every generated number. If proper values for the LCG are chosen, it … Read more
This is an interesting question. In general, the best way to know the difference between two python implementations is to inspect the code yourself: import inspect, random str_gauss = inspect.getsource(random.gauss) str_nv=inspect.getsource(random.normalvariate) and then you print each of the strings to see how the sources differ. A quick look at the codes show that not only … Read more
A linear feedback shift register is pretty simple, as long as you’re comfortable with thinking in binary (or maybe hex, since it’s easy to map between the two). A more complex one is Xorshift, but if you know your bitwise operations, it should be quite possible to work with as well.
In your array implementation, your Query 1.1 seems to be the best way to do things. The only other way to remove a random element would be to move everything up to fill its spot. So if you had [1,2,3,4,5] and you removed 2, your code would move items 3, 4, and 5 up and … Read more
Is there a reasonably simple way to replace srand() and rand()? Full disclosure: I don’t like rand(). It’s bad, and it’s very easily abused. The C++11 random library fills in a void that has been lacking for a long, long time. The problem with high quality random libraries is that they’re oftentimes hard to use. … Read more
Yes there is, but you need a different or to put it exactly, the same PRNG on each platform. std::default_random_engine engine is a implementation defined PRNG. That means you may not get the same PRNG on every platform. If you do not have the same one then your chances of getting the same sequence is … Read more
float RandomFloat(float a, float b) { float random = ((float) rand()) / (float) RAND_MAX; float diff = b – a; float r = random * diff; return a + r; } This works by returning a plus something, where something is between 0 and b-a which makes the end result lie in between a and … Read more
Pure mathematics: Let’s calculate the quantity of rand() function calls in both cases and compare the results: Case 1: let’s see the mathematical expectation of calls on step i = k, when you already have k numbers chosen. The probability to get a number with one rand() call is equal to p = (n-k)/n. We … Read more