Home
Quicklinks
Readinglist
Articles
Languages
Computing
Math
Music
Science
Misc
Help
Log in
Algorithms
|
Apple
|
AssemblyLanguage
|
BASH
|
Bash Cookbook
|
C-Programmming
|
CommonLisp
|
Computer Security
|
CuisSmalltalk
|
Databases
|
Emacs
|
Exploitation
|
Firewalls
|
Fortran
|
Functional Programming
|
Git
|
GNUSmalltalk
|
Haskell
|
Social Engineering
|
Javascript
|
Julia
|
Linux
|
Machine Learning
|
Metasploit
|
Machine Learning
|
Networking
|
Operating Systems
|
Open Data Science
|
Odin
|
Picolisp
|
Pharo Smalltalk
|
Purescript
|
Python
|
Racket
|
Scheme
|
Unity
|
vim
|
V
|
Web Development
|
Windows WSL
|
Zig
Algorithms
Numerical
Randomizing Data
The Linear Congruential Generator
Xn+1 = (A.Xn+1 + B).Mod(M)
Where
A, B and M
are constants. This will generate a sequence of numbers that appear to be random.
Linked Lists
Arrays
Stacks and Queues
Sorting
Searching
Hash Tables
Recursion
Trees
Network Based
String
Distributed
Links
Youtube:Optimal Stopping Problem
Algorithm Visualizer
http:///wiki/?algorithms
20jun23
admin