[Haskell-beginners] Optimising a combinatorial algorithm?

Daniel Trstenjak daniel.trstenjak at gmail.com
Thu Sep 24 14:41:52 UTC 2015


Hi Mario,

I just took a quick look on the implementation of 'dur'
and as a first thing I would replace foldl with
the strict version foldl'.

This already might explain the memory usage.

Greetings,
Daniel


More information about the Beginners mailing list