Permutations of all subsets

3 Responses to Permutations of all subsets

1. Gustavo Niemeyer says:

   2005/04/08 at 14:17

   I’ve just posted an entry showing how to do that, and how many outputs it yields.

   Thanks for asking!
2. Anonymous says:

   2005/04/08 at 11:32

   i really like these permutation algorithms because I have no idea how they work and that’s the fun :)

   i am actually looking for an algorithm, which would give me all possible combination for a list of chars.

   say I have: a list l = [‘a’,’b’,’c’]
   when you set a border of 3, it wil generate the following

   a
   b
   c
   aa
   ab
   ac
   ba
   bb
   bc
   ca
   cb
   cc
   aaa
   aab
   until ‘ccc’

   etcetera
3. M. Kara says:

   2005/05/27 at 08:03

   I need an algorithm like this:

   For a given integer n, find all integer subsets s1, s2, …, sk where sum(s1) = n, sum(s2) = n etc.

   For example, for n = 5

   s1 = {5}
   s2 = {4, 1}
   s3 = {3, 2}
   .
   .
   .
   sk = {1, 1, 1, 1, 1}

   Thanks in advance…

   M. Kara