Timeline for Shuffle product of two lists
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2014 at 14:07 | history | edited | Yi Wang | CC BY-SA 3.0 | deleted 176 characters in body |
| Feb 4, 2014 at 12:50 | history | edited | Yi Wang | CC BY-SA 3.0 | deleted 176 characters in body |
| Feb 4, 2014 at 12:26 | history | edited | Yi Wang | CC BY-SA 3.0 | added 981 characters in body |
| Feb 4, 2014 at 10:55 | comment | added | ciao | @YiWang: Very nice. +1 | |
| Feb 4, 2014 at 10:51 | comment | added | Mr.Wizard | Please see the timings I added to my answer. In some cases your method is far and away the fastest method yet posted, when applied correctly. Well done. | |
| Feb 4, 2014 at 10:33 | comment | added | Mr.Wizard | Notes: (1) If the lists that are assembled are short Insert is not expensive; this is a good method. (2) Because you Fold over lst1, lst1 should be the shorter of the two lists if there is one; this will be much faster than the other way around. | |
| Feb 4, 2014 at 10:18 | history | edited | Yi Wang | CC BY-SA 3.0 | deleted 1 characters in body |
| Feb 4, 2014 at 10:13 | comment | added | Yi Wang | Thanks a lot @Mr.Wizard! This is indeed cleaner! | |
| Feb 4, 2014 at 10:11 | history | edited | Mr.Wizard | CC BY-SA 3.0 | added 66 characters in body |
| Feb 4, 2014 at 10:09 | comment | added | Yi Wang | Sure. You are welcome to edit! | |
| Feb 4, 2014 at 10:08 | comment | added | Mr.Wizard | That is quite a clean method, and I see the possibility to make this code a bit cleaner still. May I edit your post with these changes? If you don't like them you can simply "revert" the edit to undo them. | |
| Feb 4, 2014 at 10:04 | history | answered | Yi Wang | CC BY-SA 3.0 |