Found a neat little site on programming puzzles for prolog programmers today in my lunch break. Of course I needed to try one immediately! Just for the fun of it and to see if haskell is suitable for this prolog problems.
Here is the problem for the prolog site:
1.28 (**) Sorting a list of lists according to length of sublists
a) We suppose that a list (InList) contains elements that are lists themselves. The objective is to sort the elements of InList according to their length. E.g. short lists first, longer lists later, or vice versa.
L = [[o], [d, e], [d, e], [m, n], [a, b, c], [f, g, h], [i, j, k, l]]
That does not seem to be a challenge. Start by importing some modules:
import Data.List import Data.Function
So the solution to the problem is actually just to find a suitable formulation in haskell:
lsort = sortBy (compare `on` length)
Couldn’t be more straight forward! Now move on to the second part:
b) Again, we suppose that a list (InList) contains elements that are lists themselves. But this time the objective is to sort the elements of InList according to their length frequency; i.e. in the default, where sorting is done ascendingly, lists with rare lengths are placed first, others with a more frequent length come later.
L = [[i, j, k, l], [o], [a, b, c], [f, g, h], [d, e], [d, e], [m, n]]
Note that in the above example, the first two lists in the result L have length 4 and 1, both lengths appear just once. The third and forth list have length 3; there are two list of this length. And finally, the last three lists have length 2. This is the most frequent length.
Just a little more involved…but again, simple in haskell:
lfsort xs = let ys = groupBy (\x y->length x == length y) (lsort xs) in concat $ sortBy (compare `on` length) ys
great! 3 lines in haskell to solve this! now back to work… :)
Full source-code is available here.
title-image by boris drenec (license)