[Haskell-cafe] Question about memory usage

[Ivan Lazar Miljenovic]

Sebastian Fischer <sebf at informatik.uni-kiel.de> writes:

> 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 at gmail.com
IvanMiljenovic.wordpress.com