Timeline for Random number generator that returns unique 64-bit numbers in sorted order
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 7, 2017 at 17:52 | comment | added | Craig | Agreed. Possibly in the "or more". This does serve the unbiased and low memory. It requires no startup time. It is very simple to write. If it can be used as a generator and it can produce the numbers when needed to be consumed, the question is if this can keep up. If not then this takes an unreasonable amount of time. | |
| Jul 7, 2017 at 15:56 | comment | added | whuber♦ | The methods in the reference provided by the OP will be far, far faster than your proposal, likely by four or more orders of magnitude. | |
| Jul 7, 2017 at 15:53 | comment | added | Craig | Long enough that I did not want to test my idea! But if the OPs program, lets call it a simulation, needs that much input, I am guessing that is not a quick program either. The incremental cost of getting the next input to the simulation may be minimal in the grand scheme if this can be run as a generator and may not have exactly $10^{12}$ numbers. Or the cost may not be minimal. | |
| Jul 7, 2017 at 15:43 | comment | added | whuber♦ | Ouch! How long do you suppose it would take to examine $2^{64} \approx 18\times 10^{18}$ numbers? You are ultimately selecting less than one in every ten million of them. | |
| Jul 7, 2017 at 15:37 | review | First posts | |||
| Jul 7, 2017 at 15:39 | |||||
| Jul 7, 2017 at 15:33 | history | answered | Craig | CC BY-SA 3.0 |