Timeline for Using a non cryptographic PRNG for randomized algorithms
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 5, 2017 at 14:23 | history | edited | Thomas Pornin | CC BY-SA 3.0 |
added 1 character in body
|
| Jun 5, 2017 at 14:22 | comment | added | CodesInChaos | Nowadays the popular choice for sorting is starting with quicksort and falling back to a O(n log(n)) worst-case algorithm when it detects too deep recursion. Introsort is an early example of this technique. | |
| Jun 5, 2017 at 12:59 | history | answered | Thomas Pornin | CC BY-SA 3.0 |