17 Aug
2010
17 Aug
'10
7:09 a.m.
Sebastian Fischer
On Aug 17, 2010, at 8:39 AM, Roel van Dijk wrote:
That is an interesting trick. So there exists an algorithm that calculates Fibonacci numbers in O(log n) time.
This is what my program does. But it's only O(long n) [snip]
Are you getting Haskell mixed up with C or something? We don't have a "long" value type... ;-) -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com IvanMiljenovic.wordpress.com