4 ms·
Okasaki's work depends crucially on laziness for turning amortized time bounds into per operation time bounds. Is that the case with the linked work too?
by tome 9y ago
Okasaki's work depends crucially on laziness for turning amortized time bounds into per operation time bounds. Is that the case with the linked work too?
- loopingoptimism 9y agoNo, the linked work describes eager data structures that use techniques such as path-copying for persistence. No laziness required.