Question

You have a row of 2n disks of two colors, n dark and n light.
They alternate: dark, light, dark, light, and so on. You want to get all the dark
disks to the right-hand end, and all the light disks to the left-hand end. The
only moves you are allowed to make are those that interchange the positions
of two neighboring disks. Design an algorithm for solving this puzzle and determine the number of moves it takes.

Answer 1

ALGORITHM DiskColors( )

//Input: two colors dark and light placed in alternatively.

// Output: Move dark disks to right hand side and light disks to left hand side.

Consider light disk as 0 and dark disk as 1.

First compare first two disks,

if i < 1 swap it with each of the light disks to the left handside.

else swap it with each of the dark disks to the right hand side.

Repeat this process until i ≤ n.

The total number of moves it made is