I am trying not to reinvent the wheel, hence this question. Strictly
speaking this is more a python than sympy question, but I think the
mathematical abilities of the sympy group would lead to a more optimized
answer.
The question is if I have a list (tuple, etc.) of integers what is the
most optimal (short list < 20) way of calculating the sign of the
permutation. Return 1 if even, Return -1 if odd, and return 0 if any
members occur more that once.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sympy?hl=en.
