Timeline for Decompose a permutation into cycles
Current License: CC BY-SA 2.5
29 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 3, 2023 at 1:56 | answer | added | 138 Aspen | timeline score: 1 | |
| Feb 4, 2022 at 21:38 | answer | added | Sundar R | timeline score: 0 | |
| Feb 4, 2022 at 17:58 | answer | added | l4m2 | timeline score: 1 | |
| Feb 4, 2022 at 12:50 | answer | added | ophact | timeline score: 1 | |
| Aug 5, 2021 at 11:26 | answer | added | ryno | timeline score: 0 | |
| Mar 4, 2021 at 19:03 | answer | added | caird coinheringaahin g♦ | timeline score: 1 | |
| Sep 28, 2016 at 20:32 | comment | added | Keith Randall | @Evpok: it's there in case it helps. No need to use it. | |
| Sep 8, 2016 at 11:15 | comment | added | Evpok | What is the point of having N in the input ? | |
| Aug 14, 2014 at 2:18 | answer | added | YosemiteMark | timeline score: 1 | |
| Aug 13, 2014 at 20:59 | answer | added | ɐɔıʇǝɥʇuʎs | timeline score: 2 | |
| Aug 13, 2014 at 0:30 | history | edited | A Frayed Knot |
edited tags
|
|
| Feb 15, 2014 at 14:40 | history | edited | Doorknob |
edited tags
|
|
| May 25, 2012 at 8:11 | history | edited | Peter Taylor |
tag
|
|
| Apr 7, 2011 at 21:55 | comment | added | aaaaaaaaaaaa | I now remove my 38 chars solution. | |
| Apr 7, 2011 at 21:54 | history | edited | aaaaaaaaaaaa |
edited tags
|
|
| Apr 2, 2011 at 20:53 | history | tweeted | twitter.com/#!/StackCodeGolf/status/54285451112103936 | ||
| Mar 23, 2011 at 3:55 | vote | accept | Keith Randall | ||
| Mar 22, 2011 at 1:07 | comment | added | Quixotic | Nice problem, I thought of adding this one before but never got the right opportunity.Thanks :-) | |
| Mar 20, 2011 at 8:09 | answer | added | 6502 | timeline score: 1 | |
| Mar 20, 2011 at 4:52 | comment | added | Mateen Ulhaq | @Keith I count from 42 by exponential increasing increments. | |
| Mar 19, 2011 at 20:58 | answer | added | 6502 | timeline score: 3 | |
| Mar 18, 2011 at 23:45 | comment | added | Keith Randall | Mathematicians count from 1, computer scientists count from 0 :) | |
| Mar 18, 2011 at 16:23 | comment | added | Dr. belisarius | Permutations are usually counted up from 1, not 0. | |
| Mar 18, 2011 at 2:05 | answer | added | MtnViewMark | timeline score: 1 | |
| Mar 17, 2011 at 18:14 | comment | added | Keith Randall | Let's say N<1000. | |
| Mar 17, 2011 at 18:07 | comment | added | Eelvex |
3 chars in J :>C.
|
|
| Mar 17, 2011 at 17:52 | answer | added | fR0DDY | timeline score: 4 | |
| Mar 17, 2011 at 17:34 | comment | added | fR0DDY | @Keith What is the maximum value of N? | |
| Mar 17, 2011 at 17:14 | history | asked | Keith Randall | CC BY-SA 2.5 |