Permutations algoritm?

[Manuel M. Garcia]

Oh, I just re-read your question.
You will just want to use _subsets_ofsize_help(n,m)

Manuel

On Fri, 15 Nov 2002 23:40:44 GMT, Manuel M. Garcia
<mgarcia at cole-switches.com> wrote:
(edit)
>def _subsets_ofsize_help(n, m):
>    if m == 0:
>        return [ [] ]
>    elif n == 0:
>        return []
>    elif m == 1:
>        return [ [i] for i in range(n) ]
>    else:
>        s0 = _subsets_ofsize_help(n-1,m)
>        s1 = _subsets_ofsize_help(n-1,m-1)
>        for i in range(len(s1)):
>            s1[i].append(n-1)
>        s0.extend(s1)
>        return s0