Merge pull request thuva4#356 from AtoMc/master

thuva4 · web-flow · commit 3f7239843897 · 2017-10-25T09:53:23.000+05:30
Add Xor swap for Java
diff --git a/README.md b/README.md
@@ -61,6 +61,7 @@ TernarySearch | :+1: |:+1:  |  | :+1: | :+1: |  |  |  |
 Topological Sort |  |  |  |  | :+1: |  |  |  |  
 Segmented Sieve |:+1:| :+1: |  |  | :+1: |  |  |  |  
 Union Find |:+1:|:+1:|  |  |  |  |  |  |  
+Xor swap |:+1:|  |  |  |  |  |  |  |
 
 
 ### List of Algorithms :
@@ -769,7 +770,7 @@ Union Find |:+1:|:+1:|  |  |  |  |  |  |
 
 * Xiaolin Wu's line algorithm    :    algorithm for line antialiasing.
 
-* Xor swap algorithm    :    swaps the values of two variables without using a buffer
+* [Xor swap algorithm](XorSwap)    :    swaps the values of two variables without using a buffer
 
 * Yamartino method    :    calculate an approximation to the standard deviation &sigma;&theta; of wind direction &theta; during a single pass through the incoming data
 
diff --git a/XorSwap/Java/XorSwap.java b/XorSwap/Java/XorSwap.java
@@ -0,0 +1,27 @@
+/**
+ * XOR swap is an algorithm that uses the XOR bitwise operation to swap 
+ * values of distinct variables without using a temporary variable. 
+ * 
+ * @author Atom
+ * @see <a href="https://en.wikipedia.org/wiki/XOR_swap_algorithm">XOR swap</a>
+ */
+public class XorSwap {
+	
+	public static void main(String[] args) {
+		for (int i = -1, j = 3; i <= 3; i++, j--) {
+			int x = i;
+			int y = j;
+			System.out.print("x = " + x + ", y = " + y);
+			
+			// Xor swap. Swap values without using a temporary variable
+			if (x != y) {
+				x ^= y;
+				y ^= x;
+				x ^= y;				
+			}
+			
+			System.out.println(", swap(x, y) -> x = " + x + ", y = " + y);
+		}
+	}
+
+}
