Bitwise XOR (^)

The XOR operator (^) compares two numbers bit by bit. The result has a 1 when the bits differ, and 0 when they're the same.

Example: $12 \wedge 10$. In binary, $12 = 1100$ and $10 = 1010$. Comparing: $1\wedge1=0$, $1\wedge0=1$, $0\wedge1=1$, $0\wedge0=0$. Result: $0110 = 6$.

XOR has a magic property: $x \wedge x = 0$ and $x \wedge 0 = x$. This makes XOR perfect for finding unique elements, toggling bits, and swapping values without a temporary variable.