Timeline for Implement Bogosort
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 8, 2016 at 3:52 | comment | added | STDQ | Problem is that rand is not guaranteed to have good quality of random numbers let alone uniformity, some produce non-random low-order bits. I guess it doesn't nor should matter in the end. I only got 8 more bytes using a uniform distributor with std::shuffle and so forth, good enough for me. | |
| Jun 6, 2016 at 0:54 | comment | added | user54200 | So if I use a fully random one like using srand(time(0)) then does it count? | |
| Jun 6, 2016 at 0:46 | comment | added | STDQ | It relies on rand() which is not uniform -- see open-std.org/jtc1/sc22/wg21/docs/papers/2014/n3924.pdf . Not many other people are seem to be following so meh i guess it's not a big deal. | |
| Jun 5, 2016 at 2:23 | comment | added | user54200 | Okay... i didn't know it was not uniform. | |
| Jun 4, 2016 at 21:30 | comment | added | STDQ | std::random_shuffle is not uniform. In the clarifications it is stated: "Also, the shuffling has to be uniform" | |
| Jun 4, 2016 at 16:04 | history | edited | user54200 | CC BY-SA 3.0 |
added 51 characters in body
|
| Jun 4, 2016 at 15:59 | history | edited | Martin Ender | CC BY-SA 3.0 |
added 6 characters in body
|
| Jun 4, 2016 at 15:50 | review | Late answers | |||
| Jun 4, 2016 at 17:27 | |||||
| Jun 4, 2016 at 15:35 | review | First posts | |||
| Jun 4, 2016 at 15:49 | |||||
| Jun 4, 2016 at 15:34 | history | answered | user54200 | CC BY-SA 3.0 |