Timeline for Array-like data structure with O(1) worst-case concatenate/join?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 23, 2015 at 17:56 | history | edited | eold | CC BY-SA 3.0 |
merge -> concatenate/join (this is the precise operation I am interested in)
|
| Jan 23, 2015 at 14:24 | history | tweeted | twitter.com/#!/StackCSTheory/status/558631321791389696 | ||
| Jan 23, 2015 at 5:23 | comment | added | Kaveh | Then you can just keep a separate list of items. Btw, I think the correct term for what you want is "indexed" not "sorted" or "ordered". | |
| Jan 23, 2015 at 5:20 | history | edited | Kaveh | CC BY-SA 3.0 |
added 138 characters in body; edited tags
|
| Jan 23, 2015 at 5:02 | comment | added | eold | By sorted, I mean not by element values but by their index, which is let's say the order in which they were appended to the initially empty list-like data structure. | |
| Jan 23, 2015 at 4:42 | answer | added | jbapple | timeline score: 4 | |
| Jan 23, 2015 at 1:18 | history | asked | eold | CC BY-SA 3.0 |