Generally by using three minimum assignment statements, algorithm can interchang

Question

Generally by using three minimum assignment statements, algorithm can interchange the values of variables as shown below: The Algorithm to interchange the values of the variables x and y:

procedure interchange(x, y: real numbers)
a:=x
x:=y
y:=a

To write an algorithm by using only assignment statements that replaces the triples(x,y,z) with (y, z, x) use the strategy by interchanging the values of variable by using assignment statements.
Let a, b, and c be three new variables.
First assign x value to a, y value to b, and z valued to c, then assign y value to the variable x, z value to the variable y, and x value to the variable z, and then finally a assign to y, b assign to z and c assign to x.

The Algorithm to replace the triple (x, y, z) with (y,z,x):

procedure replace((x,y,z),(y,z,x): triples with real coordinates)
a:=x
b:=y
c:=z
x:=y
y:=z
z:=x
y:=a
z:=b
x:=c
Therefore, the Algorithm needs minimum nine assignments to replace the triples (x,y,z) with (y,z,x)

Explanation / Answer

int temp=x;

x=y;

y=z;

z=temp;

so only 4 assignmnets are made

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.