“Swap without temp?” 😈x ^= y ^= x ^= y;“Bro used black magic 💀”🧠 It’s not magic—it’s the XOR swap

Hinzugefügt: 2026-05-16

The XOR swap algorithm allows swapping two variables without using a temporary variable by leveraging the XOR bitwise operation, which flips bits where values differ; the three-step process (x ^= y ^= x ^= y) works because XORing a value with itself yields zero, enabling the original values to be recovered through successive XOR operations.