A conceptually organized way to see all the calculation is the following:
The cross ratio of $x_1,x_2,x_3,x_4$ is the unique $\lambda$ such that the 4-point configuration $(x_1,x_2,x_3,x_4)$ is equivalent to $(\infty,0,1,\lambda)$ by Möbius transform. (There are other conventions, but it always involve moving $x_1,x_2,x_3$ to three standard points and call the resulting fourth point the cross ratio.)
From this viewpoint, the effect of permuting $(x_1,x_2,x_3)$ is easy to figure out by writing down the unique Möbius transform that takes $(\infty,0,1)$ to a permutation of it. This pins down all permutations of $S_4$ that fixes 4. So you will have a table with 6 entries containing things like
$(x_2x_1:x_3x_4)=1/\lambda$, etc.
Then we use the property that if we exchange two pairs of points simultaneously, the cross ratio does not change. A statement and a conceptual proof is as follows.
Theorem. The configuration $(x_1,x_2,x_3,x_4)$ is equivalent to $(x_2,x_1,x_4,x_3)$ under Möbius transform.
Proof. We claim that any Möbius transform that swaps two points must be an involution. If the claim is proved, consider the unique Möbius transform $T$ that exchanges $x_1,x_2$ and take $x_3$ to $x_4$. Since it is an involution, $T(x_4)=T(T(x_3))=id(x_3)=x_3$, so we are done.
To prove the claim, let $S$ be any Möbius transform that swaps $x_1,x_2$. Work over complex numbers, $S$ must have a fixed point (either by the existence of solution to a quadratic equation, or by the existence of an eigenvector for any $2\times 2$ matrix defining $S$), call it $x_0$, which must be different from $x_1,x_2$. Now since $S$ swaps $x_1,x_2$ and fixes $x_0$, $S^2$ must fix $x_0,x_1,x_2$. But any Möbius transform that fixes three distinct points must be the identity map, so $S^2=id$ as claimed. QED
====
Note that the proof clearly works for other two switching $(13)(24)$ and $(14)(23)$ as well.
With these two in mind, one can easily convert every permutation to one of the 6 entries in your table. For example, say we want $(x_3x_4:x_2x_1)$. Then we shall permute $x_4$ to the last place. Recall the simultaneously swapping rule and the table entry, we get $$(x_3x_4:x_2,x_1)=(x_2x_1:x_3x_4)=1/\lambda.$$