Timeline for Monty Hall Optimization in Python 3.5
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 19, 2016 at 15:10 | history | edited | Graipher | CC BY-SA 3.0 |
deleted 1 character in body
|
| Sep 15, 2016 at 4:10 | comment | added | jeremy radcliff | Thank you very much for adding those details, I'm going to time the different approaches you mention and see which one is better. | |
| Sep 15, 2016 at 4:06 | vote | accept | jeremy radcliff | ||
| Sep 13, 2016 at 20:14 | history | edited | Graipher | CC BY-SA 3.0 |
added 11 characters in body
|
| Sep 13, 2016 at 11:52 | history | edited | Graipher | CC BY-SA 3.0 |
added 2478 characters in body
|
| Sep 13, 2016 at 11:33 | comment | added | Graipher | @jeremyradcliff Oops, not very attentive today. Yeah, there is some minor changes I would propose. I'll edit them in in a sec. | |
| Sep 13, 2016 at 11:30 | comment | added | jeremy radcliff | Thank you for your answer. I wrote python 3.5 in the title but I could've mentioned it again in the body of the question. I didn't know python 2.x's range returned a list, I guess once i got comfortable with list comprehension I just started using it everywhere. Algorithmically speaking, is there anything I could optimize? For example, redudant logic or something long those lines. Or maybe something better than removing items from a list? | |
| Sep 13, 2016 at 10:57 | history | edited | Graipher | CC BY-SA 3.0 |
deleted 388 characters in body
|
| Sep 13, 2016 at 8:50 | history | edited | Graipher | CC BY-SA 3.0 |
added 131 characters in body
|
| Sep 13, 2016 at 7:51 | history | answered | Graipher | CC BY-SA 3.0 |