Skip to main content

Merge sort a linked list

Sorting a linked list is much more complex than sorting an array. Because you need to be wary of links at each step and update them.

The most convenient ways of sorting a linked list is insertion sort, where in you remove one node at a time from list and insert them to the sorted list in correct position.

But merge sorting a linked list uses another approach. It splits the list into two halves, sorts them recursively and then merges them maintaining ascending order of key values.

So the three basic parts of this approach are
  1. Splitting the list into two halves of equal length
  2. Sorting these halves
  3. Merging the halves
Step 2 is in fact not needed if the list has only one node. One node is sorted. Hence the merge sort algorithm is

  1. If the list has more than one node
  2. Splitting the list into two halves of equal length
  3. Sorting these halves recursively using steps 2 to 4
  4. Merging the halves 

 Split the list into halves

We have seen in this post how to find the mid point of a linked list. Let us use this approach.

We need to use two pointers say slow and fast. Slow moves one node at a time. And fast moves two nodes at a time. When fast has reached end of the list, slow has reached mid point. 

And also we should detach first half of the list from second half.

NODEPTR split_list(NODEPTR head)
{
    NODEPTR slow,fast;
    slow =head; 
    fast = head;
    if(head==NULL || head->next==NULL)     
       return head; /* if only one node is present, return*/
    NODEPTR temp;
    while(fast!=NULL)         
    {       
        fast = fast->next;        
        if(fast!=NULL){
           temp = slow;
           fast = fast->next;
           slow = slow->next;
        }           
     }     
     temp->next  = NULL;/*detach first half of list from second half*/
     return slow; /*this is the head of second half of list*/
}

 Merge sorted sublists

To merge the two sublists which are already sorted we need to compare nodes from two lists, insert the smaller one into the merged list and move to next node in that list. This process has to be repeated until all nodes of both lists are merged. If the two sublists are of unequal length then one list will have nodes remaining, which should be added to merged list

NODEPTR merge_sorted_lists(NODEPTR head1,NODEPTR head2)
{
 NODEPTR newlist = NULL;
 while(head1!=NULL && head2!=NULL )
 {
    if(head1->val <head2->val)
  {
  NODEPTR temp = head1;
  head1 = head1->next; 
  temp->next = NULL;
  newlist = append_node(newlist,temp);
  }
    else
  {
  NODEPTR temp = head2;
  head2 = head2->next; 
  temp->next = NULL;
  newlist = append_node(newlist,temp);
  }
 }
 while(head1!=NULL)
 {
  NODEPTR temp = head1;
  head1 = head1->next; 
  temp->next = NULL;
  newlist = append_node(newlist,temp);
  }
 while(head2!=NULL)
 {
  NODEPTR temp = head2;
  head2 = head2->next; 
  temp->next = NULL;
  newlist = append_node(newlist,temp);
 }
 return newlist;  
}
 

Merge sort the list

 Let us use these two functions in the algorithm given earlier to merge sort the list.

NODEPTR merge_sort(NODEPTR head)
{
     if(head==NULL || head->next==NULL)
       return head; /* list has one node or is empty*/
     NODEPTR mid = split_list(head);
     head = merge_sort(head);/* sort first sublist*/
     mid = merge_sort(mid);/* sort second sublist*/
     head = merge_sorted_lists(head,mid);/* merge these*/
     return head;
}

You can download the entire program from here 
Labels:

Comments

Post a Comment

Popular posts from this blog

Linked list in C++

A linked list is a versatile data structure. In this structure, values are linked to one another with the help of addresses. I have written in an earlier post about how to create a linked list in C.  C++ has a library - standard template library which has list, stack, queue etc. data structures. But if you were to implement these data structures yourself in C++, how will you implement? If you just use new, delete, cout and cin, and then claim it is your c++ program, you are not conforming to OOPS concept. Remember you have to "keep it together". Keep all the functions and variables together - in a class. You have to have class called linked list in which there are methods - append, delete, display, insert, find, find_last. And there will also be a data - head. Defining node We need a structure for all these nodes. A struct can be used for this purpose, just like C. struct node { int val; struct node * next; }; Next we need to define our class. W
Post a Comment
Read more

Swap nodes of a linked list

Qn: Write a function to swap the adjacent nodes of a singly linked list.i.e. If the list has nodes as 1,2,3,4,5,6,7,8, after swapping, the list should be 2,1,4,3,6,5,8,7 Image from: https://tekmarathon.com Though the question looks simple enough, it is tricky because you don't just swap the pointers. You need to take care of links as well. So let us try to understand how to go about it. Take two adjacent nodes p1 and p2 Let prevnode be previous node of p1 Now link prevnode to p2 Link p2 to p1 Link p1 to next node of p2 So the code will be prevnode -> next = p2; p1 -> next = p2 -> next; p2 -> next = p1; But what about the start node or head? head node does not have previous node If we swap head with second node, modified head should be sent back to caller  To take care of swapping first and second nodes, we can write p1 = head; p2 = head -> next; p1 -> next = p2 -> next; p2 -> next = p1; head = p2;  Now we are read
Post a Comment
Read more

Binary tree deletion - non-recursive

In the previous post we have seen how to delete a node of a binary search tree using recursion. Today we will see how to delete a node of BST using a non-recursive function. Let us revisit the 3 scenarios here Deleting a node with no children just link the parent to NULL Deleting a node with one child link the parent to  non-null child of node to be deleted Deleting a node with both children select the successor of node to be deleted copy successor's value into this node delete the successor In order to start, we need a function to search for a node in binary search tree. Did you know that searching in  a BST is very fast, and is of the order O(logn). To search Start with root Repeat until value is found or node is NULL If the search value is greater than node branch to right If the search value is lesser than node branch to left.  Here is the function NODEPTR find_node (NODEPTR root,NODEPTR * parent, int delval) { NODEPTR nd = root; NODEPTR pa = root; if (root -> v
Post a Comment
Read more