Want to win a PS4? Go Premium and enter to win our High-Tech Treats giveaway. Enter to Win

x
Solved

# nietod...Help with algorithm

Posted on 2000-02-14
Medium Priority
291 Views
You solved the josephus algorithm i posted. I'm trying to implement it now with a circular linked list. An have no idea where to start it. this is the class im using:

#ifndef CIRCLIST_H
#define CIRCLIST_H

#include <iostream.h>

template <class T>
class CircularList {
public:
CircularList();
~CircularList();
int Add(T item);                     // return -1 if out of memory
int Remove(int index);
int Get(int index, T&item) const;    // return -1 if not gotten
int Empty() const { return size==0; }
int Size() const { return size; }
struct Node {
T data;
Node *left, *right;
};
private:
int size;
};

//----------------------------//
template <class T>
CircularList<T>::CircularList() {
size=0;
}

//----------------------------//
template <class T>
CircularList<T>::~CircularList() {
while (Size()>0) Remove(0);
}

//----------------------------//
template <class T>
Node *temp, *cur;
temp = new Node;                    // get a new node and fill with data
if (temp==NULL) { cout << "Out of memory for linked list node allocation: Add() failed." << endl; return -1; }
temp->data = item;

while(cur != head  &&  cur->data < temp->data) {
cur=cur->right;
}

temp->right = cur;
temp->left = cur->left;
cur->left->right = temp;
cur->left = temp;

return 1;
}

//----------------------------//
template <class T>
int CircularList<T>::Remove(int index) {
if (Empty() || index<0 || index>=Size() ) return -1;
Node *cur;
for (int i=0; i<index; i++) {
cur=cur->right;
}                                   // at end of loop, cur is pointing
// to the node to delete
cur->left->right = cur->right;
cur->right->left = cur->left;

delete cur;                         // free up space
return size;
}

//----------------------------//
template <class T>
int CircularList<T>::Get(int index, T &item) const {     // similar to Remove
if (Empty() || index<0 || index>=Size() ) return -1;
Node *cur;
for (int i=0; i<index; i++) {
cur=cur->right;
}                                   // at end of loop, cur is pointing
// to the node to get
item=cur->data;                     // transfer data
return 1;
}

//----------------------------//
template <class T>
int CircularList<T>::Find(T item) const {
if (Empty()) return -1;
int index=0;
cur=cur->right;
index++;
}
return (cur==head ? -1 : index);
}

#endif

0
Question by:milalik
[X]
###### Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

• Help others & share knowledge
• Earn cash & points
• 3

LVL 22

Expert Comment

ID: 2523033
What exactly is the question?

I assume the josephus algorithm needs to store data (I'm not familar with the algorithm) so the data will be stored in this circular queue.
0

LVL 22

Accepted Solution

nietod earned 150 total points
ID: 2523172
I found the algorithm from your other question.

Since this is probably accademic, I can't give you the answer--that is unethical--but I'll give you some help to get you started.  Ask if you have questions or need more help.

Start with all the items in the queue  Then use a loop to remove items from the queue.  Each item removed is placed back in the queue until you come to an item that should be "skipped".  If the item should be skipped don't place it back in.  When you come to a case where you remove an item from the queue and the queue is left empty (i.e. there had been 1 item in the queue), then you are done.  The item you just removed is te last one.
0

Author Comment

ID: 2523442
Okay so I add the items to the list in the main. Then perform the Remove with the conditions every m-time..and when the only one number ends I'm done?
0

LVL 22

Expert Comment

ID: 2523463
That's it.
0

## Featured Post

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

When writing generic code, using template meta-programming techniques, it is sometimes useful to know if a type is convertible to another type. A good example of when this might be is if you are writing diagnostic instrumentation for code to generat…
Often, when implementing a feature, you won't know how certain events should be handled at the point where they occur and you'd rather defer to the user of your function or class. For example, a XML parser will extract a tag from the source code, wh…
The goal of the video will be to teach the user the difference and consequence of passing data by value vs passing data by reference in C++. An example of passing data by value as well as an example of passing data by reference will be be given. Bot…
The viewer will be introduced to the member functions push_back and pop_back of the vector class. The video will teach the difference between the two as well as how to use each one along with its functionality.
###### Suggested Courses
Course of the Month10 days, 20 hours left to enroll