Thank you for the comprehensive reply Yitzchak.
On Wed, Aug 5, 2009 at 2:22 PM, Yitzchak Galeg...@sefer.org wrote:
Hi Slavomir,
Slavomir Kaslev wrote:
inter x [] = [[x]]
inter x yys@(y:ys) = [x:yys] ++ map (y:) (inter x ys)
perm [] = [[]]
perm (x:xs) = concatMap (inter x) (perm xs)
I
))
I've just noticed that permutations and perm enumerate the
permutations in different order.
On 8/4/09, Slavomir Kaslev slavomir.kas...@gmail.com wrote:
A friend mine, new to functional programming, was entertaining himself by
writing different combinatorial algorithms in Haskell. He asked me
On Tue, Aug 4, 2009 at 9:23 PM, Daniel Fischerdaniel.is.fisc...@web.de wrote:
Am Dienstag 04 August 2009 19:48:25 schrieb Slavomir Kaslev:
A friend mine, new to functional programming, was entertaining himself by
writing different combinatorial algorithms in Haskell. He asked me for some
help
