Sorting of Singly Linked List

void single_linked_list::sort()

{

node *temp,*current;

temp = first_node;

current = temp->link;

for(int i = 1;i < no_of_elements();i++)

{

   while(current!=NULL)

   {

    if(temp->data>=current->data)

    {

       current->data=(temp->data)+(current->data);

       temp->data=(current->data)-(temp->data);

       current->data=(current->data)-(temp->data);

       current=current->link;

    }

    else

    {

      current=current->link;

     }

   }

   temp=temp->link;

   current=temp;

   current=current->link;

}

}