How to calculate
Count pairs where a larger entry appears before a smaller entry. An even inversion count means even parity. For n at least two, switching two entries pairs every even permutation with an odd one.
Worked example
Use Operation Count by number of objects · Number of distinct objects 4. The result is 12.
Input and result notes
Enter numbers using the same units. Rounded results are marked with ≈.
MIT Mathematics for Computer Science