[EMAIL PROTECTED] wrote:
> Given a list of elements that are either a character or a character
> follows by a number, e.g.
>
> ['a', 'b', 'c1', 'd', 'e1', 'f', 'c2', 'x', 'e2']
>
> find all the permutations that are given by switching the positions of
> the elements that:
> (1) begins with the
On Jun 20, 12:37 pm, [EMAIL PROTECTED] (Alex Martelli) wrote:
> [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
> > Hi,
>
> > I have been working at this problem, and I think I need apermutation
> > algorithm that does
> > the following:
>
> > Given a list of elements that are either a character or a
[EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
> Hi,
>
> I have been working at this problem, and I think I need a permutation
> algorithm that does
> the following:
>
> Given a list of elements that are either a character or a character
> follows by a number, e.g.
>
> ['a', 'b', 'c1', 'd', 'e1',
