Skip to content

Add Linear Congruential Generator #182

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
varunu28 merged 1 commit into from
Oct 11, 2017
Merged

Add Linear Congruential Generator #182

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
57 changes: 57 additions & 0 deletions Misc/LinearCongruentialGenerator.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,57 @@
/***
* A pseudorandom number generator.
*
* @author Tobias Carryer
* Date: October 10, 2017
*/
public class LinearCongruentialGenerator {

private double a, c, m, previousValue;

/***
* These parameters are saved and used when nextNumber() is called.
* The current timestamp in milliseconds is used as the seed.
*
* @param multiplier
* @param increment
* @param modulo The maximum number that can be generated (exclusive). A common value is 2^32.
*/
public LinearCongruentialGenerator( double multiplier, double increment, double modulo ) {
this(System.currentTimeMillis(), multiplier, increment, modulo);
}

/***
* These parameters are saved and used when nextNumber() is called.
*
* @param seed
* @param multiplier
* @param increment
* @param modulo The maximum number that can be generated (exclusive). A common value is 2^32.
*/
public LinearCongruentialGenerator( double seed, double multiplier, double increment, double modulo ) {
this.previousValue = seed;
this.a = multiplier;
this.c = increment;
this.m = modulo;
}

/**
* The smallest number that can be generated is zero.
* The largest number that can be generated is modulo-1. modulo is set in the constructor.
* @return a pseudorandom number.
*/
public double nextNumber() {
previousValue = (a * previousValue + c) % m;
return previousValue;
}

public static void main( String[] args ) {
// Show the LCG in action.
// Decisive proof that the LCG works could be made by adding each number
// generated to a Set while checking for duplicates.
LinearCongruentialGenerator lcg = new LinearCongruentialGenerator(1664525, 1013904223, Math.pow(2.0, 32.0));
for( int i = 0; i < 512; i++ ) {
System.out.println(lcg.nextNumber());
}
}
}