Timeline for Random number generation, without built-in random number generation libraries
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Feb 25, 2014 at 13:49 | history | edited | undergroundmonorail | CC BY-SA 3.0 |
I made an edit to my code earlier and fixed the byte count, but forgot to actually make the change on the post...
|
| Feb 24, 2014 at 20:56 | history | edited | Victor Stafusa | CC BY-SA 3.0 |
Syntax coloring
|
| Feb 24, 2014 at 19:59 | comment | added | yo' | In most situations, using the runtime tickcount is quite a safe seed (similar to what you do), but certainly not in the system's kernel, since the risk of reoccurance of the same seed is more than high. | |
| Feb 24, 2014 at 19:55 | comment | added | undergroundmonorail | Dang, I felt clever for almost a whole minute. :P | |
| Feb 24, 2014 at 19:54 | comment | added | yo' | Last part is not true at all on machines with single running process, or in environments especially made to emulate that situation. | |
| Feb 24, 2014 at 19:53 | history | answered | undergroundmonorail | CC BY-SA 3.0 |