Re: [Haskell-beginners] Optimising a combinatorial algorithm?

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