Answer
The required algorithm is:
procedure swap($x, y:$ two numbers)
temp$:=x$
$x:=y$
$y:=$temp
Work Step by Step
Notice how we need to have a temporary variable to store the value of $x$ since that value gets lost when we assign $y$ to $x$. The minimum number of assignments needed is $3$ and we cannot do any better.
