How to sort three variables using at most two swaps?

Question

The following algorithm can sort three variables x, y and z of type K which are comparable using operator<

Answer 1

If you don't do it in place, you can perform it without any swaps.