jake at pikewerks.com
Sun Nov 30 11:24:56 EST 2008
-----BEGIN PGP SIGNED MESSAGE-----
On Nov 30, 2008, at 10:17 AM, Luke Palmer wrote:
> On Sun, Nov 30, 2008 at 9:06 AM, Jake Mcarthur <jake at pikewerks.com>
>> -----BEGIN PGP SIGNED MESSAGE-----
>> Hash: SHA1
>> On Nov 30, 2008, at 9:03 AM, Andrew Coppin wrote:
>>> OK, so here's something just for fun:
>>> Given a list of items, find all possible *unique* permutations of
>>> list. (E.g., the input list is explicitly _allowed_ to contain
>>> The output list should not contain any duplicate permutations.)
>>> I've found one simple way to do this, but I'm sure there are
>>> valid approaches. So let's see what people come up with. ;-)
>> Seems a bit easy, I think.
>> Data.List.permutations . nub
> That is not what he meant. Given:
> The results should be:
> Assuming I didn't miss any...
Oh, I see. Okay, I see why that would be an interesting exercise then.
Thanks for clearing that up.
- - Jake
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.8 (Darwin)
-----END PGP SIGNATURE-----
More information about the Haskell-Cafe