Analyzing Efficiency

[Shawn P. Garbett]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

I've come up with three different methods of approach to solve the same 
problem in haskell. I would like to compare the three in terms of reductions, 
memory usage, and overall big O complexity.

What's the quickest way to gather these stats? I usually use the ghc 
compiler, but also have hugs installed. The big O complexity probably has to 
be done by hand, but maybe there's a tool out there to do it automagically.

Shawn
- -- 
You're in a maze of twisty little statements, all alike.
Public Key available from http://www.garbett.org/public-key
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.7 (GNU/Linux)

iD8DBQE9WU0BDtpPjAQxZ6ARAkTKAJ9qixYy5MT5QGyJ/95NGLNgVTECCQCfVVVV
GHELk++jO8XzaWUbp/mb9Og=
=MYjn
-----END PGP SIGNATURE-----