On 18/01/2008, Bertram Felgenhauer <[EMAIL PROTECTED]> wrote: > I have some ideas, but maybe you want to work on a correct solution > first?
There is an implementation on the wikipedia article for Haskell: hamming = 1 : map (2*) hamming `merge` map (3*) hamming `merge` map (5*) hamming where merge (x:xs) (y:ys) | x < y = x : xs `merge` (y:ys) | x > y = y : (x:xs) `merge` ys | otherwise = x : xs `merge` ys -- Dougal Stanton [EMAIL PROTECTED] // http://www.dougalstanton.net _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe