Timeline for Shuffle a ragged array
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 9, 2016 at 2:31 | comment | added | user62131 |
sort doesn't work properly when given an inconsistent comparison key. Even if the language's random is random, its sort will malfunction in this situation, and that's what's creating the bias you're seeing. As such, I think the second solution is incorrect.
|
|
| Dec 8, 2016 at 23:05 | history | edited | ETHproductions | CC BY-SA 3.0 |
fix wording
|
| Dec 8, 2016 at 23:04 | comment | added | ETHproductions | @ConorO'Brien "Each integer must have an equally likely chance to appear in each possible location." | |
| Dec 8, 2016 at 22:44 | comment | added | Conor O'Brien | "You can assume that your language's built-in random is random." | |
| Dec 8, 2016 at 21:57 | history | edited | ETHproductions | CC BY-SA 3.0 |
added 294 characters in body
|
| Dec 8, 2016 at 21:50 | history | edited | ETHproductions | CC BY-SA 3.0 |
golfed 3 bytes
|
| Dec 8, 2016 at 21:41 | history | answered | ETHproductions | CC BY-SA 3.0 |