# Merge Sort For Linked List ## Introduction

Sorting in programming refers to placing the elements of a data structure in a specific and meaningful manner. Sorting is an essential part of data processing. Efficient sorting algorithms are crucial so that we can perform operations that require sorted input optimally.

Whenever we search for something on Amazon or Flipkart, the search result is sorted based on filters like relevance, price, and rating. These companies deal with enormous data sets, so it becomes crucial to use a sorting algorithm that can provide results lightning-fast and provide users a hassle-free experience.

Due to its importance in system design, questions on sorting algorithms are prevalent in technical interviews of companies like Google, Amazon, Microsoft, and Facebook.

It is vital to know how these sorting algorithms work internally. Having in-depth knowledge of sorting algorithms will help you to become a great software developer.

Merge sort is one of the most efficient sorting algorithms. Today in this article, we will discuss the merge sort for a linked list with its implementation. But before diving into the concepts of merge sort, let’s understand the basics first.

## What is Merge Sort?

Merge sort is a divide and conquer algorithm. It divides the list repeatedly into smaller sublists until each sublist contains a single element and merges back these sublists in such a manner that results in a sorted list.

Now the question is, why does it even work? What is its fundamental working principle of merge sort?

The fundamental working principle of merge sort is that a list of size one is always sorted! Meaning, if we consider that we are having only a single element in the list, then the list is sorted, and while merging back, the idea is to merge two sublists that are sorted. So at the core, this problem is broken down into merging two sorted lists into a third one which is a famous and a standard question!

Recommended: Please solve it on CodeStudio first before moving on to the solution.

## Algorithm

Merge sort is easy to implement, but you should have a sound knowledge of recursion. Recursion is very important to implement the merge sort for linked lists. As mentioned earlier in the definition, the merge sort has two main parts: the first is to break down the list into smaller parts, effectively called smaller sublists, and the second one is to merge the sublists, assumed to be sorted(we know the assumption is true as The Principle of Mathematical Induction, PMI comes to rescue.

Read the blog on Recursion and Backtracking Algorithm With Practice Problem to learn more) to get the final sorted linked list. So we will create two functions. The first function will recursively divide the linked list into smaller sublists, and another function will merge it back, effectively merging the two sorted lists.

```mergeSort()

1)If the list contains only one node, return the head of the list.

2)Else, divide the list into two sublists. For this, we will take call middle() in which we will take two pointers

'MID' and 'TAIL' which will initially point to the head node. We will change 'MID' and 'TAIL' as follows until 'TAIL' becomes NULL:
'MID' = 'MID' -> next
'TAIL' = 'TAIL' -> next -> next.

3)After getting mid we wiil make next node of mid to NULL to break connection between two list

4)Sort the two sublists using mergeSort()
mergeSort(mid)

5)Merge the two sublists by calling mergeSortedList().```

Algorithm for mergeSortedList()

```mergeSortedList()

else compare the head of both linked list whichever is minimum make it the new head and initialize the variable tail to keep track of tail of linked list.
Traverse both the linked lists simultaneously.
Compare the elements of first linked list with second and add smaller one after the tail and update the tail.
If any of the list reaches end then make the tail to point at the non null linked list and return the newhead```

Code:

```//merge sort for linked list
#include<iostream>
using namespace std;

class Node {
public:
int data;
Node* next;
};

//Function to merge two sorted linked list
{
Node *tail=NULL;

}
else {
}

{
}
else {
}

tail=tail->next;

}

{
}
{
}

}

//function to calculate the mid of a linked list

while(mid->next != NULL && (tail!=NULL && tail->next!=NULL)) {
mid = mid->next;
tail = tail->next->next;
}
return mid;
}

{

//Base case:- if size of linked list is 0 or 1
{
}

//Creating node to store mid of linked list
Node* mid=new Node();

mid->next=NULL;

}

// Function to insert a node at the beginning of the linked list
{
//allocate memoray for new node
Node* newNode=new Node();

//put the data in new node
newNode->data=newdata;

//link the list to the new node

}

void printList(Node* node)
{
while (node != NULL) {
cout << node->data << " ";
node = node->next;
}
cout<<endl;
}

int main()
{

//creating a unsorted list
//to test out the function
//list: 40->25->2->10->7->1

}```

Output:

```Linked list before sorting:
40 25 2 10 7 1
1 2 7 10 25 40```

Time Complexity:

The recurrence relation for merge sort algorithm can be written as :

T(n)  =  2T(n / 2)  +  θ(n)

This recurrence relation can be solved by the recurrence tree or master theorem.

The recurrence tree for the above relation can be drawn as:

Image source: researchgate.net

We are dividing the list into two parts at each step till each sublist contains only one element, so the number of levels in this tree would be log2n, and at these different levels, while merging back the list, we will at max compare n elements. So the time complexity of the merge sort is θ(n*log2n).

The time complexity of Merge Sort in worst, average, and best case is θ(n*log2n)  as merge sort always divides the list into two halves regardless of the fact that what is the present state of the list and takes linear time to merge the list.

Space Complexity:O(logN) where N is the number of nodes in the linked list.

What is a merge sort algorithm with an example?

Merge sort is a divide and conquer algorithm. It divides the list repeatedly into smaller sublists until each sublists contains a single element and merges back these sublists in such a manner that results in a sorted list. Ex: sorting the students’ details on the basis of their marks.

How does merge sort for linked list work?

Merge sort algorithm is a divide and conquer algorithm it divides the list into smaller sublist until each sublist contains only a single element, and an list of size one is always sorted using this property it merges two sorted sublists to a single sorted list.

Does merge sort require extra space?

Yes, merge sort for linked list requires O(logn) extra space.

## Key Takeaways

In this article, we discussed the merge sort for linked list with all crucial aspects that are necessary to implement the merge sort for linked list. We discussed the merge sort algorithm in detail and implemented the merge sort in c++. We also took a look at the time and space complexity of merge sort for linked list in detail.

If you are a beginner in coding and want to learn DSA then you can look out for our guided path for DSA which is absolutely free!

If you want to solve more problems like this which have been asked in the interviews, big tech giants like Amazon, Flipkart, Google, and Facebook, you can look out for interview problems at Code Studio.

Happy Learning!

#BeCurious

By: Pranchal Agrahari