Timeline for Using Memoization with a Mutable Object
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 23, 2012 at 16:07 | comment | added | rcollyer | As an interesting side note, repeated applications on the same data set do not give any additional speed-up. Likely, that is the cost of traversing the tree itself. Also, for Andy's question, though, OrderedQ puts $\pm\infty$ at the end, so to use it with those values, Less is better, but not any faster. :P | |
| Apr 23, 2012 at 15:35 | history | edited | rcollyer | CC BY-SA 3.0 | added word |
| Apr 23, 2012 at 15:19 | comment | added | rcollyer | +1, that's an interesting idea I hadn't considered. | |
| Apr 23, 2012 at 15:12 | history | answered | Pillsy | CC BY-SA 3.0 |