how to sort a linked list using selection sort

[Tash876]

#include <iostream>
#include <string>
#include "Employee.h";
#include "EmployeeList.h";

using namespace std;

void main()
{

	EmployeeList a;

	a.AddNode(43,"rene","briggs");
	a.AddNode(23,"brian","shay");
	a.AddNode(98,"poppy","doll");
	a.AddNode(76,"greg","flynt");
	
	a.bubbleSort();
	system("pause");

}

#include <iostream>
#include <string>
#include "Employee.h";

using namespace std;
#ifndef EMPLOYEELIST_H
#define EMPLOYEELIST_H


class EmployeeList
{
    private:
	
    Employee *head;//employee pointer(head pointer)

    public:
	
	//default constructor
     EmployeeList()
     {
         head = NULL;
     }
   


	//Add a node to the end of the list
     void AddNode(int id, string fName, string lName)
     {		

	Employee *node  = new Employee(id,fName,lName);	
   
	//if memory was sucessfully allocated
	if (node != NULL)
	{
	    //if this is the first node to be added 
	    //or if list is empty
	    if (head == NULL)
	    {
		head = node;//make the first element
	    }
	    else
	    {   ///if the list is not empty

	       Employee *temp = head;            
		
                while(temp->getNext() != NULL)
	       {				
		   temp = temp->getNext();//points temp to the next element		
	        }

	        temp->setNext(node);//the end is reached we insert the element
	     }
	}

	else

	{
		cout << "Unable to create new node." << endl;
	}
}
			
			
	

	//display list 
    void displayList()
	{
		Employee *temp = head;
		while (temp != NULL)
		{
		temp->display();//Employee's display method called here
		temp = temp->getNext();
		}

	}
    

void bubbleSort(){
      Employee*holder, *previous, *position;
      Employee *temp = head;//assigns the head to a temporary pointer
      EmployeeList *list;

      Employee *previousnode = NULL;//set the previous node to point to null

      while (temp != NULL)//while not the end of the list
      {
	for (holder=temp; holder!=NULL && holder->next!=NULL;  holder=holder-         >next){

	previous = holder;

	   for(position=holder->next; position!=NULL; position=position->next){

		if(position->getIdNumber()< previous->getIdNumber()){

		       previous = position;
		}
	    }

		temp = holder;
		holder = previous;
		head = holder;
		previous = temp;

	 }
	     list->displayList();
			
      }

   }

};
#endif 

#include <string>
#include <iostream>

using namespace std;

#ifndef EMPLOYEE_H
#define EMPLOYEE_H

class Employee
{

private: 

	int idNumber;
	string firstName;
	string lastName;



	//Employee * next;

public:
//define accessors, constructors, destructor,display method and mutators
Employee * next;
//default constructor
Employee()
{
	idNumber = 1; //default value for employeeID
	firstName = "John"; //default value for employee First Name
	lastName ="Doe"; //default value for employee Last name


	next = NULL; 
}



Employee(int id,string fname,string lname)
{
	idNumber = id;
	firstName = fname;
	lastName =lname; 
	next = NULL; 
}

//destructor
~Employee()
{
	cout << "\nEmployee Node  ["<< getIdNumber() << " " << getFirstName()<< " "<<getLastName() << "]  Destroyed"<<endl;

}


int getIdNumber()
{
	return idNumber;
}

//LastName mutator
void setIdNumber(int id)
{
	idNumber = id;
}

//add mutator for idNumber below


//lastName accessor
string getLastName()
{
	return lastName;
}

//LastName mutator
void setLastName(string lName)
{
	lastName = lName;
}


//firstName accessor
string getFirstName()
{
	return firstName;
}

//LastName mutator
void setFirstName(string fName)
{
	firstName = fName;
}


//firstName accessor
Employee* getNext()
{
	return next;
}


//LastName mutator
void setNext(Employee *nxt)
{
	next = nxt;
}


void display()
{
//display should output to user like this [1-John-Jones]->

	cout<<idNumber<<"-"<<firstName<<"-"<<lastName<<endl;
}

};///end of class


#endif