Timeline for Pseudo random permutation of a very large number of elements
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 6 at 20:41 | history | edited | JPF | CC BY-SA 4.0 |
added 454 characters in body
|
| Apr 5 at 19:50 | comment | added | D.W.♦ | Please don't put clarifications in the comments. Instead, edit the question so it is clear for someone who encounters it for the first time. We want people to be able to understand what is being asked, without having to read the comments. Our purpose is to build an archive of knowledge that will be useful to others. Thank you! | |
| Apr 4 at 18:55 | history | became hot network question | |||
| Apr 4 at 12:57 | answer | added | orlp | timeline score: 4 | |
| Apr 4 at 12:31 | comment | added | codeR | How large can your $p$ (or should it be $m$?) be compared to $n$? | |
| Apr 4 at 11:40 | comment | added | orlp | Do you wish for efficient random access to the random permutation ('give me the $i$th element of the shuffled elements'), or do you truly wish to permute the entire file? | |
| S Apr 4 at 10:55 | review | First questions | |||
| Apr 5 at 19:52 | |||||
| S Apr 4 at 10:55 | history | asked | JPF | CC BY-SA 4.0 |