[Haskell-cafe] Re: The Knight's Tour: solutions please

[Diego Echeverri]

>>I've created a wiki page,
>>http://haskell.org/haskellwiki/The_Knights_Tour
>>I note the LogicT version is the shortest so far.
>>-- Don

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)
for
sortOn' f = sortBy (comparing fst)

The first one was much faster? Why?

Thanks!
Diego