JAVA: Josephurs Problem

(from array to linked list)

Use the code in order to accomplish the following (implementing linked list):

- It uses exactly the amount of space as needed at the moment;

it will get rid of the do while loop as contained in the above algorithm, thus it takes ?(kn) to complete; and

it also gets rid of the for loop in Lines 13 through 15, since the index of the last remaining node is the answer we are looking for.

1. Location0) 16 n; print A[i]