How to resolve the algorithm Random number generator (included) step by step in the Elena programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Random number generator (included) step by step in the Elena programming language

Table of Contents

Problem Statement

The task is to: Note: the task is not to create an RNG, but to report on the languages in-built RNG that would be the most likely RNG used. The main types of pseudo-random number generator (PRNG) that are in use are the Linear Congruential Generator (LCG), and the Generalized Feedback Shift Register (GFSR), (of which the Mersenne twister generator is a subclass). The last main type is where the output of one of the previous ones (typically a Mersenne twister) is fed through a cryptographic hash function to maximize unpredictability of individual bits. Note that neither LCGs nor GFSRs should be used for the most demanding applications (cryptography) without additional steps.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Random number generator (included) step by step in the Elena programming language

Source code in the elena programming language

import extensions;
 
public program()
{
    console.printLine(randomGenerator.nextReal());
    console.printLine(randomGenerator.nextInt(0,100))
}

  

You may also check:How to resolve the algorithm Colorful numbers step by step in the AppleScript programming language
You may also check:How to resolve the algorithm Walk a directory/Non-recursively step by step in the PowerShell programming language
You may also check:How to resolve the algorithm Disarium numbers step by step in the Arturo programming language
You may also check:How to resolve the algorithm Hailstone sequence step by step in the Amazing Hopper programming language
You may also check:How to resolve the algorithm Terminal control/Clear the screen step by step in the Tcl programming language