Q:

find parity with inversion of permutation (14)(256)

For the permutation
$$\pi= \begin{bmatrix} 1& 2& 3 &4& 5& 6 \\ 4 & 6& 3 & 1 & 2 & 5\end{bmatrix}$$
Find the number of inversions and parity.

$\pi=(14)(256)=(14)(25)(26)$. It is suppose to be odd.
Double check with parity and  bernard's  example

A:

There is another way to find the parity, by counting the number of inversions, i.e., the number of cases where we have simultaneously $i<j$ and $\pi(i)>\pi(j)$. 
It is not sufficiently known that, for small length permutations, this can be done graphically by counting the number of intersections of the line segments joining, say, $(k,1)$ and $(\pi(k),0)$ as shown below for this example, where we find 9 intersections. The parity of this number, $(-1)^9=-1$, is the answer.

