Algorithm how to memorize ordination

And is that the aux the number 'a' and the number 'b'.

And is that the command is aux receive 'a' and 'a' receive 'b' and 'b' receive aux, that is 'a' so 'b' receive the 'a'.

something like that 

aux = a; a = b; b = aux;

And to memorize if aux is equal 'a' the aux is erased and 'a' and aux have 'a';

And if 'a' equal 'b' what is in 'a' gonna be erased and 'b' and 'a' gonna have 'b'.

and for the end 'b' equal to aux so what is in 'b' will be erased and 'b' and aux gonna have the same value that was what aux receive from 'a', but what matters is 'b' and who cares what is in aux that is there only to make the swap. Rute Bezerra de Menezes Gondim