Skip to content
Advertisement

Tag: haskell

Haskell extremely slow simple recurrence

I’m experimenting with Haskell profiling with a simple recursive max algorithm: When I compare it to a python imperative equivalent, I get a 10x speed factor in favor of python: It seems there is an inherent limitation of using tail recursion in the Haskell case, am I right? Any other way to make the Haskell code faster? The input file

Advertisement