Timeline for Faster derangements?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 23, 2017 at 14:59 | comment | added | Mr.Wizard | @Martin Please, even if it is not fast I want to see that. | |
| Mar 23, 2017 at 14:46 | comment | added | Martin Ender | @Mr.Wizard Right, I just wasn't sure whether "this is the fastest method I have come up with" included attempting non-filtering methods or not. :) I think it should be possible to generate them directly recursively, based on the recurrence of the subfactorial numbers, but I'm not sure how good I am with writing fast Mathematica code. I'll give it a try and see what I come up with. | |
| Mar 23, 2017 at 14:44 | comment | added | Mr.Wizard | @MartinEnder I only considered faster discarding (filtering) methods. I don't even know how one would directly generate these without discarding, hence Can we generate these directly and avoid filtering entirely? which you'll note I did not self-answer. | |
| Mar 23, 2017 at 13:39 | comment | added | Martin Ender | Have you tried a non-discarding approach and found it to be slower, or did you just look into faster discarding approaches so far? | |
| Mar 23, 2017 at 13:28 | comment | added | Mr.Wizard | @ubpdqn Thank you. :-) | |
| Mar 23, 2017 at 11:00 | comment | added | ubpdqn | such a neat way...brought me knowledge (and joy after a bad day) +1:) | |
| Mar 23, 2017 at 10:40 | history | edited | J. M.'s missing motivation♦ | CC BY-SA 3.0 |
added 1 character in body
|
| Mar 23, 2017 at 4:14 | history | answered | Mr.Wizard | CC BY-SA 3.0 |