got some good answers to my fibonacci question https://gist.github.com/3525074
-
@liammclennan Is the infinite list faster? I am interested to know why the Haskell implementation is slower for you. Cc@dibblego
@tarnacious @liammclennan The same code in any strict language would spin in a loop (or exception).
-
-
@dibblego@liammclennan I understand the awesomeness of lazy evaluation :-)Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@dibblego@liammclennan I also understand how memorisation helps a fib algorithm :-) I will look up Dynamic Programming Algorithm.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@dibblego@tarnacious what about Rob's IEnumerable + yield example? -
@liammclennan@tarnacious That's quite different code, but it is linear. The haskell, ported to java, parallelised https://github.com/functionaljava/functionaljava/blob/master/demo/src/main/fj/demo/concurrent/Fibs.java …
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.