Re: [Haskell] Pearls of Functional Algorithm Design question

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 highly recommend the book.