This is the java implementation of Multiply With Carry (MWC) algorithm to generate a set of random numbers. The main advantages of the MWC method are that it invokes simple computer integer arithmetic and leads to very fast generation of sequences of random numbers with immense periods. The formula it uses is, x(n) = (a*x(n-r) + c(n-1))mod n and c(n) = (a*x(n-r) + c(n-1))/n, where a is any multiplier, m is modulus, c is carry and r is initial number of seeds.
Here is the source code of the Java Program to Generate Random Numbers Using Multiply with Carry Method. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a sample program to generate a random numbers based on Multiply with carry method import java.util.Random; public class Multiply_With_Carry { public static void main(String args[]) { int max_Sequence_Elements = 10; Random random = new Random(); int base_b = 2000; int multiplier_a = random.nextInt(base_b); int r = 1; int []c = new int[max_Sequence_Elements]; int []x = new int[max_Sequence_Elements]; c[0] = random.nextInt(multiplier_a); x[0] = random.nextInt(base_b); System.out.print("The random number sequence is: " + x[0]); //generating sequence for(int i=1; i<max_Sequence_Elements; i++) { x[i] = (multiplier_a*x[i-r] + c[i-1]) % base_b; c[i] = (multiplier_a*x[i-r] + c[i-1]) / base_b; System.out.print(" " + x[i]); } } }
Output:
$ javac Multiply_With_Carry.java $ java Multiply_With_Carry The random number sequence is: 795 382 1487 260 475 1798 1347 722 1389 63
Related posts:
Java Program to Perform Optimal Paranthesization Using Dynamic Programming
Java Program to Perform String Matching Using String Library
Hướng dẫn Java Design Pattern – DAO
Join and Split Arrays and Collections in Java
Spring 5 Testing with @EnabledIf Annotation
Giới thiệu Java 8
Java Program for Topological Sorting in Graphs
Toán tử trong java
Implementing a Binary Tree in Java
Spring Boot Integration Testing with Embedded MongoDB
Java Program to Implement Skip List
Java Program to Implement Binomial Heap
Java Program to Find the Shortest Path Between Two Vertices Using Dijkstra’s Algorithm
Documenting a Spring REST API Using OpenAPI 3.0
Spring MVC Custom Validation
Display Auto-Configuration Report in Spring Boot
Java Program to Implement Heap’s Algorithm for Permutation of N Numbers
New Features in Java 15
Creating a Web Application with Spring 5
What is Thread-Safety and How to Achieve it?
Map to String Conversion in Java
Cachable Static Assets with Spring MVC
Consumer trong Java 8
Apache Commons Collections MapUtils
Function trong Java 8
Introduction to Java 8 Streams
Derived Query Methods in Spring Data JPA Repositories
XML-Based Injection in Spring
Java Program to Perform Encoding of a Message Using Matrix Multiplication
Mix plain text and HTML content in a mail
Lớp TreeMap trong Java
Java CyclicBarrier vs CountDownLatch