Timeline for How can I regroup elements in a list into a tree based on their values?
Current License: CC BY-SA 3.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 31, 2017 at 13:42 | answer | added | Mr.Wizard | timeline score: 1 | |
| Oct 15, 2012 at 7:33 | vote | accept | M.R. | ||
| Sep 21, 2012 at 4:24 | answer | added | kglr | timeline score: 2 | |
| Sep 20, 2012 at 22:48 | history | edited | M.R. | CC BY-SA 3.0 | added 955 characters in body |
| Sep 20, 2012 at 22:42 | history | edited | M.R. | CC BY-SA 3.0 | added 955 characters in body |
| Sep 20, 2012 at 12:27 | answer | added | Leonid Shifrin | timeline score: 11 | |
| Sep 20, 2012 at 1:27 | answer | added | halirutan | timeline score: 8 | |
| Sep 20, 2012 at 0:48 | history | edited | M.R. | CC BY-SA 3.0 | deleted 6 characters in body |
| Sep 20, 2012 at 0:03 | history | tweeted | twitter.com/#!/StackMma/status/248572957725687809 | ||
| Sep 19, 2012 at 23:53 | history | edited | M.R. | CC BY-SA 3.0 | added 520 characters in body |
| Sep 19, 2012 at 23:45 | history | edited | M.R. | CC BY-SA 3.0 | added 9 characters in body |
| Sep 19, 2012 at 23:37 | comment | added | M.R. | Arbitrarily deep, that's where the trickiness of the problem lies. | |
| Sep 19, 2012 at 23:35 | comment | added | rm -rf♦ | Are your lists always 3 levels deep or do you have arbitrarily deep lists? | |
| Sep 19, 2012 at 23:35 | history | edited | M.R. | CC BY-SA 3.0 | added 96 characters in body |
| Sep 19, 2012 at 23:28 | comment | added | M.R. | Yes. The elements in the input list are always in order, and at least they could always be sorted by their first element. | |
| Sep 19, 2012 at 23:23 | comment | added | J. M.'s missing motivation | Can the starting list always be assumed to be "properly ordered"? | |
| Sep 19, 2012 at 23:23 | history | edited | M.R. | CC BY-SA 3.0 | added 71 characters in body |
| Sep 19, 2012 at 23:16 | history | asked | M.R. | CC BY-SA 3.0 |