Dear all, > due to the sparse representation using lists generating (and GC'ing) > many, many cons cells.
uh, actual lists (Prelude.[])? > By using a non-sparse representation (that is, a > matrix), space use might be larger, but more predictable/constant (but > make sure to use a mutable matrix). (perhaps out of scope for this student project, but) make sure to introduce an abstraction layer so that it is possible to switch the underlying data representation without changing the implementation of the algorithm? there are lots of ways to represent matrices (both sparse and full). what size are we talking about, for this application? > What you could do, is run with memory profiling also, http://hackage.haskell.org/package/ekg for live profiling. Good luck with the project - J.
