Re: [Haskell-cafe] how can I select all the 3-element-combination out of a list efficiently

Mirko Rahn writes: (snip)

Correct (and more natural):

nOf 0 _ = [[]] nOf n (x:xs) = map (x:) (nOf (n-1) xs) ++ nOf n xs nOf _ [] = []

Thanks very much - in both claims you're indeed correct. -- Mark