By bloid
via debasishg.blogspot.com
Published: Oct 03 2008 / 12:50
I needed a List with fast random access capabilities. Standard implementations of a List takes O(i) to access the ith element. I am using Scala and arrays do not really cut as a well-behaved functional data structure. Besides I needed dynamic resizing, persistence and good worst case complexity. Anyway I was trying to justify implementing Okasaki's Purely Functional Random Access Lists ..
Add your comment
Voters For This Link (11)
-
bloid -
debasishg -
Moominpapa -
rvirding -
queus -
mswatcher -
rob.signorelli -
thinkingserious -
yardena -
zis -
daniel


