Announcements

Another way to think about this is that you should not use iterators (as in the std::list::iterator or cs2list::iterator type), but instead you should use pointer operations

Here is a more extensive example that might help in understanding this. When you step through the list and reach the next person to "die", you will stop at a node in the list containing a person's name. In using cs2list or std::list you would step through using an iterator and then call "erase" using that iterator. This would actually call "delete" (see the code for cs2list::erase) that node. Then you would call "insert" or "push_back" to add the name of the person to the end of a second list that keeps the order the names were removed. This involves a "new" operation. Instead, for the Josephus problem, you should be using pointers to step through the linked structure and use pointer operations to remove the *node* from the one list and put the node on a second list *without* new or delete.