Richard sent me a note offlist which quickly cleared up my
misconception. I was mistaken that table could contain n^2 elements.
A closer reading of the definition of table makes it clear that it
will have n elements, so the n log n bound makes perfect sense to me
now.
Thanks!
--Mark
P.S. I hig
I'm currently reading the excellent Haskell-based book "Pearls of
Functional Algorithm Design". I have a question about Chapter 2, the
"surpassing problem".
According to the book, "since join takes linear time, table is
computer in O(n log n) steps".
However, as far as I can tell, join takes lin
How do you guys debug your Haskell programs? As far as I can tell, none of
the compilers support any sort of source debugging.
--Mark Engelberg
ok it in the spirit I intended, and the
feedback you've given me has been quite valuable.
Thanks,
Mark Engelberg
Thanks Jan-Willem for providing a Haskell program that comes closer to
capturing the same spirit as the algorithm I used to implement the
Cryptarithm solver in C++. There are still differences between the two
approaches: C++'s next_permutation permutes the array in place and provides
an iterativ
y representative of how to best implement this algorithm in Haskell,
so the comaprison to C++ is probably unfair.
So I ask you who are more experienced: What would be a better way to
implement this program in Haskell?
Looking forward to your responses,
Mark Engelberg
