Question

Consider an algorithm that uses only assignment statements that replaces the quintuple (v, w, x, y, z) with (w, x, y, z, v). What is the minimum number of assignment statements needed?

Answer 1

So you need to shift everything to left by 1 position

Answer 2

i dont understand

Answer 3

is the answer 1?

Answer 4

(v, w, x, y, z) with (w, x, y, z, v).

```
a=v
v=w
w=x
x=y
y=z
z=a
```

Answer 5

im guessing you will need 6 assign statements in above sequence ^

Answer 6

were does a come in to the equation

Answer 7

it is a temporary variable to save the contents of `v`

Answer 8

oh k so i still dont understand what the answer would be

Answer 9

you need a minimum of 6 assignments if you work it like above

Answer 10

can you explain it i dont learn by some one saying I need the steps to figure it out

Answer 11

assignments are always destructive. they replace the contents of the variable with a new value. therefore it is impossible to preserve all the data without a temporary variable.

Answer 12

ok

Answer 13

Now check ganeshie8's list of assignments and confirm for yourself that it does indeed work.

Answer 14

i would assume that it would because a would logically be the next letter after z

Answer 15

The name \(a\) is arbitrary, it could be anything. You could actually name it \(temp\) if you like.

Answer 16

so now that i understand it how do i write the answer by 6 or the vxyza

Answer 17

@Alchemista I understand the equation but how do I write the answer