[Haskell-cafe] Re: The Knight's Tour: solutions please
diegoeche at gmail.com
Mon Dec 1 16:48:40 EST 2008
>>I've created a wiki page,
>>I note the LogicT version is the shortest so far.
Probably noob question. I was looking into the first solution in the
page and tried to replace
sortOn f = map snd . sortBy (comparing fst) . map (f &&& id)
sortOn' f = sortBy (comparing fst)
The first one was much faster? Why?
More information about the Haskell-Cafe