Timeline for Big O notation of randomness
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 20, 2016 at 10:06 | comment | added | Fogmeister | @JoulinRouge I'm well aware of the Fisher-Yates shuffle :) this was more of an interesting topic rather than a practical way of generating a list of random numbers :) | |
| Apr 20, 2016 at 8:42 | comment | added | JoulinRouge | here is a faster method en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle , you don't have to generate them randomly, you can shuffle them obtaining the same result | |
| Apr 20, 2016 at 7:57 | answer | added | gnasher729 | timeline score: 0 | |
| Apr 20, 2016 at 4:03 | answer | added | JBurk94 | timeline score: 1 | |
| May 14, 2015 at 19:23 | vote | accept | Fogmeister | ||
| May 14, 2015 at 9:24 | vote | accept | Fogmeister | ||
| May 14, 2015 at 10:11 | |||||
| May 14, 2015 at 9:21 | comment | added | Fogmeister | @Brandin oh absolutely. A much better way of doing it because you can generate the list and shuffle it in O(N) but I was thinking specifically of inefficient algorithms and how to analyse them. Especially I did not know about O(infinite) as a measurement. :-) | |
| May 14, 2015 at 9:19 | comment | added | Brandin | Why not generate a sequential list of numbers and then shuffle the list. Each number is guaranteed to appear only once, and the efficiency of list shuffling is well understood | |
| May 14, 2015 at 9:12 | comment | added | Fogmeister | Well for calculating the last number it will create repeat numbers an average of N-1 times before getting the last distance value. They are only stored once though. Does not store the repeated random values. | |
| May 14, 2015 at 9:11 | comment | added | Brandin | Are you worried that you will happen to generate an already used number a significant amount of time? Have you calculated how likely this is to actually happen? | |
| May 14, 2015 at 9:05 | answer | added | Jörg W Mittag | timeline score: 5 | |
| May 14, 2015 at 9:03 | comment | added | Fogmeister | @Brandin I hadn't thought about that. I guess you would use a hash to store them so it would be constant time for checking if the random number has been used. | |
| May 14, 2015 at 9:02 | comment | added | Brandin | How long does it take for you to check if the generated random number has already been used | |
| May 14, 2015 at 8:44 | history | asked | Fogmeister | CC BY-SA 3.0 |