Question

I am losing elements when I sort my Linked List. How can I sort my Linked list in alphabetical order?

Code:

void sort(Node *head)
{

Node* temp = head;
Node* tempAhead = temp -> next;
Node* buff1 = temp;
Node* buff2 = tempAhead;

while (temp -> next != NULL) {

while (tempAhead -> next != NULL) {

if (strcmp(temp -> name, tempAhead -> name) < 0) {

buff1 -> next = temp -> next;
buff2 -> next = tempAhead -> next;

temp -> next = tempAhead -> next;
tempAhead -> next = buff1 -> next;
}

tempAhead = tempAhead -> next;
}

temp = temp -> next;
}
}

OUTPUT WITHOUT sort():

chip
plat
num
quo
koa

OUTPUT WITH sort():

chip
koa

Answer 1

Answer:-(you have to use #include<string.h>)

Using Selection sort i.e finding minimum element from unsortedsub list and adding it to the already sorted sublist.

void sort(Node *head)
{
Node* temp = head; //used to keep track of the current node(node after already sorted sublist)

   // Traverse the List to find the element with minimum value ahead of temp node(including current temp node)i.e minimum in remaining unsorted sublist.
   while (temp!=NULL) {
Node* minimum = temp; //used to find the minimum.
Node* tempAhead = temp->next; //used to traverse the remaining unsorted sublist to find the minimum.

       // Traverse the unsorted sublist
       while (tempAhead!=NULL) {
           if (minimum->name > tempAhead->name)
               minimum = tempAhead;

tempAhead = tempAhead->next;
       }

       // Swap Data i.e swapping current temp node with the value of minimum in the unsorted sublist.
       string store = temp->name; //storing temp name to some string store.
       temp->name = minimum->name; //assigning temp with name of minimum of unsorted sublist.
       minimum->name = store; //assigning minimum with the name of temp stored in store variable.
       temp = temp->next;   
   }  
}