Or you could just use Data.Sequence and brows the code at your later
leisure, right? Better yet, you could forget about optimal
datastructures until you learned how to do toy problems with just
plain lists.
--S
On Oct 14, 2007, at 2:12 PM, Brian Hurt wrote:
And the situation is worse with pure functional languages. When
you move from, say C/Pascal/Fortran to Java/Ruby/Python, you don't
have to learn new data structures and new algorithms. A doubly
linked list is still just a doubly linked list, still has the same
properties, and still has more or less the same implementation. In
addition to learning Haskell, you also need to relearn basic
computer science. You need to learn what a realtime lazy catenable
dequeue is, how to implement it, and why you need one, all the
while struggling with the syntax, type errors, and all the other
problems trying to learning a new language.
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
