2 Jun
2006
2 Jun
'06
10:31 a.m.
On 6/2/06, Robert Dockins
Does Okasaki say what the bounds should be for this implementation? I imagine it's O(log n), but my lazy-amortized- complexity-analysis-fu isn't very good...
I don't have the book out from the library anymore. Anybody? There's also a paper & a thesis he wrote covering much of the same material. Some of the bounds might be in there. We should probably also check the other exercises in the book to make sure the other bounds listed in the Haddock documentation for the other data structures are correct. Jim