Main Page | See live article | Alphabetical index

# Xor swap algorithm

In computer programming, the xor swap is an algorithm which uses the exclusive disjunction (XOR) operation to swap the values of two variables without a temporary variable. This algorithm works using the symmetric difference property of XOR, that
A xor A = 0 for every A

## The algorithm

Standard swapping algorithms require the use of a temporary storage area - standard intuitive algorithms to swap x and y involve:

However, the XOR swap algorithm does not -- this algorithm follows (where X and Y are the names of two variables, rather than two values):
1. XOR X and Y and store in X
2. XOR X and Y and store in Y
3. XOR X and Y and store in X

The algorithm looks much simpler when it is written in
pseudocode.
X := X XOR Y
Y := X XOR Y
X := X XOR Y

This typically corresponds to three machine code instructions. For example, in IBM 370 Assembler code:
XOR R1, R2
XOR R2, R1
XOR R1, R2

where R1, and R2 are registers and the operation XOR leaves the result in the first argument. This algorithm is particularly attractive to assembler programmers due to its performance and efficiency. It eliminates the usage of the intermediate register which is a limited resource in machine language programming. It also eliminates two memory access cycles which would be expensive compared to a register operation.

## Explanation

For example, let's say we have two values X = 12 and Y = 10. In binary, we have
X = 1 1 0 0
Y = 1 0 1 0

Now, we XOR X and Y to get 0 1 1 0 and store in X. We now have
X = 0 1 1 0
Y = 1 0 1 0

XOR X and Y again to get 1 1 0 0 - store in Y, and we now have
X = 0 1 1 0
Y = 1 1 0 0

XOR X and Y again to get 1 0 1 0 - store in X, and we have
X = 1 0 1 0
Y = 1 1 0 0

The values are swapped, and the algorithm has indeed worked in this instance.

In general however, if we call the initial value of X = x0 and the initial value of Y = y0. Then, performing the above steps, remembering a XOR a = 0 and b XOR 0 = b

1. X = x0 XOR y0, Y = y0
2. X = x0 XOR y0, Y = x0 XOR y0 XOR y0 = x0 XOR 0 = x0
3. X = x0 XOR y0 XOR x0 = x0 XOR x0 XOR y0 = 0 XOR y0 = y0, Y = x0

## Code examples

### x86 assembly language

The following code in x86 assembly language uses the xor swap algorithm to swap the value in the AX register with the value in the BX register without using a temporary buffer.

```           XOR AX, BX
XOR BX, AX
XOR AX, BX
```
However, all x86 microprocessors have an XCHG instruction which does the same work on its operands more efficiently than the above sequence of XORs.

### Visual Basic

The following Visual Basic subroutine swaps the values of its parameters using the xor operator.

```Sub Swap (Var1, Var2)
Var1 = Var1 Xor Var2
Var2 = Var2 Xor Var1
Var1 = Var1 Xor Var2
End Sub
```

### C

C programming language code to implement XOR swap of x and y:

``` x ^= y;
y ^= x;
x ^= y;
```
The set-up as a compiler macro is common for extensive use.

#define xorSwap(x,y) {(x)=(x)^(y); (y)=(x)^(y); (x)=(x)^(y);}

As a function:

``` void xorSwap(int * x, int * y) {
*x = *x ^ *y;
*y = *x ^ *y;
*x = *x ^ *y;
}
```
It should be noted that this function will not work if you try to swap something with itself (ie here xorSwap(&var, &var) will fail - it will assign the value zero to var).

## Usage in practice

Some experienced programmers advise that this technique should not be used in programming, as its effect is not clear unless you already know the trick. However, others remark that its use is acceptable providing that the trick is wrapped in an appropriately named macro such as SWAP or XOR_SWAP, or appropriate commenting of the code is done.

The use of the algorithm is not uncommon in embedded assembly code where often there is very limited space available for temporary swap space, and this form of swap can also avoid a load/store which can make things much faster. Some optimizing compilers can generate code using this algorithm.

This trick could also be used by someone trying to win an Obfuscated C Code Contest.