need help with data structures.Looking for ways to start, sample code,

anything

Program description:

Design and implement a Visual C++ .NET program that inserts values

into a data structure and then removes them as described below.

First prompt the user to enter 3 values: an integer N from 1 to 100,

and non-negative integers J and K.

Build a data structure of size N that contains the integers 1 through

N as follows. Begin with an empty data structure, and insert the value

1. For each remaining value X from 2 through N, repeat the following

step J times: remove a value from the beginning of the data structure

and re-insert it at the end of the data structure. Then insert the new

value X at the end of the data structure, and print the data structure

after the new value X has been inserted. For example, when N=8 and

J=3:

[ 1 ]

[ 1 2 ]

[ 2 1 3 ]

[ 2 1 3 4 ]

[ 4 2 1 3 5 ]

[ 3 5 4 2 1 6 ]

[ 2 1 6 3 5 4 7 ]

[ 3 5 4 7 2 1 6 8 ]

Next remove all N values from the data structure as follows. Imagine

that the data structure is arranged in a cyclical fashion, so that

whenever you reach the end you automatically start over from the

beginning. At each step, to determine the next value that should be

removed: skip past the first K values, then remove the next value.

Print both the value that is removed and the data structure that

remains. Continuing the previous example, when K=4:

[ 3 5 4 7 2 1 6 8 ]

2

[ 1 6 8 3 5 4 7 ]

5

[ 4 7 1 6 8 3 ]

8

[ 3 4 7 1 6 ]

6

[ 3 4 7 1 ]

3

[ 4 7 1 ]

7

[ 1 4 ]

1

[ 4 ]

4

[ ]

Finally print all the values from 1 to N in the reverse of the order

in which they were previously removed:

4

1

7

3

6

8

5

2