C / C++ / MFC

for each node, Cur
  for each node, Temp
    if Temp!=Cur
      if Temp.value==Cur.value, duplicate
    Temp=Temp.next
  Cur=Cur.next

TCPMem wrote:

How to sort a list???

#include "iostream"

using namespace std;

void Add(int n);
void UniqueList(int N);

struct Elem
{
	int key;
	Elem *prev;
	Elem *next;
} *start;

int main()
{
	int num;
	int N = 0;

	start = NULL;

	while(cin >> num)
	{
		Add(num);

		N++;
	}
	
	cout << endl;

	UniqueList(N);

	return 0;
}

void Add(int n)
{
	Elem *p = start;
	start = new Elem;

	start->key = n;
	start->next = p;
	start->prev = NULL;
	
	if(NULL != p) p->prev = start;
}

void UniqueList(int N)
{
	Elem *p = start;
	int t;

	if(NULL != start) cout << "List:" << endl;
	else cout << "Empty list!";

	for(int i = 1; i < N; i++)
		for(int j = N - 1; j >= i; j--)
		{
			if(p->key > p->next->key)
			{
				t = p->key;
				p->key = p->next->key;
				p->next->key = t;
			}
		}

	while(NULL != p)
	{
		cout << p->key << endl;

		p = p->next;
	}
}

bool haveKey(Elem *p, int k)
{
   while (p!=NULL)
   {
      if (p->key=k) return true;
      p = p->next;
   }
   return false;
}

Ram Shmider wrote:

and i do not need them, if i use copy (CTRL+C) i am able to only get the text.