Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
XOR swap algorithm
open-in-new
<p>In <a href="/facts/Computer_programming/QmSsFnu0">computer programming</a>, the exclusive or swap (sometimes shortened to XOR swap) is an <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> that uses the <a href="/facts/Exclusive_or/FHyr7hGQ">exclusive or</a> <a href="/facts/Bitwise_operation/0gkqnUda">bitwise operation</a> to <a href="/facts/Swap_(computer_science)/lMfoMXCq">swap</a> the values of two <a href="/facts/Variable_(programming)/VoCKtwml">variables</a> without using the temporary variable which is normally required. </p><p>The algorithm is primarily a novelty and a way of demonstrating properties of the <i>exclusive or</i> operation. It is sometimes discussed as a <a href="/facts/Program_optimization/nXz6RpRM">program optimization</a>, but there are almost no cases where swapping via <i>exclusive or</i> provides benefit over the standard, obvious technique. </p>