Using the exclusive or operation to implement the interchange of two variables

Bitwise exclusive or operation can realize two variables worth swap without introducing temporary variables.

Int main () {int A = 10; int B = 12; cout <"A =" <A <"; "<" B = "<B <Endl; A = a ^ B; // XOR operation B = a ^ B; A = B ^; cout <"A =" <A <";" <"B =" <B <Endl ;}

We can see from the above that the exclusive or operation can be used as the simplest encryption algorithm and belongs to the symmetric encryption algorithm. Therefore, we can also know that the ciphertext obtained by this encryption algorithm is similar to that obtained by plain text, and can be easily cracked. The encryption and decryption process uses the same application.

Using the exclusive or operation to implement the interchange of two variables