Sort a Linked List Using Merge Sort in DSA C - Execution Trace

Concept Flow - Sort a Linked List Using Merge Sort

Start with head of list

↓

Check if list has 0 or 1 node?

Yes→Return head (already sorted)

No↓

Split list into two halves

↓

Recursively sort left half

↓

Merge two sorted halves

↓

Return merged sorted list

The list is split into halves recursively until single nodes remain, then merged back in sorted order.

Execution Sample

DSA C

Node* mergeSort(Node* head) {
  if (!head || !head->next) return head;
  Node* mid = getMiddle(head);
  Node* right = mid->next;
  mid->next = NULL;
  Node* left = mergeSort(head);
  right = mergeSort(right);
  return merge(left, right);
}

This code splits the list, sorts each half recursively, and merges them back sorted.

Execution Table

Step	Operation	Nodes in List	Pointer Changes	Visual State
1	Start with full list	4 nodes: 4->2->1->3->NULL	head points to 4	4 -> 2 -> 1 -> 3 -> NULL
2	Find middle node	4 nodes	mid points to 2	4 -> 2 -> 1 -> 3 -> NULL
3	Split list at mid	Left: 4->2->NULL, Right: 1->3->NULL	mid->next = NULL	Left: 4 -> 2 -> NULL, Right: 1 -> 3 -> NULL
4	Recursively sort left half	2 nodes: 4->2->NULL	head points to 4	4 -> 2 -> NULL
5	Find middle of left half	2 nodes	mid points to 4	4 -> 2 -> NULL
6	Split left half	Left: 4->NULL, Right: 2->NULL	mid->next = NULL	Left: 4 -> NULL, Right: 2 -> NULL
7	Sort left-left half	1 node: 4->NULL	head points to 4	4 -> NULL
8	Sort left-right half	1 node: 2->NULL	head points to 2	2 -> NULL
9	Merge left halves	2 nodes	merge 4 and 2	2 -> 4 -> NULL
10	Recursively sort right half	2 nodes: 1->3->NULL	head points to 1	1 -> 3 -> NULL
11	Find middle of right half	2 nodes	mid points to 1	1 -> 3 -> NULL
12	Split right half	Left: 1->NULL, Right: 3->NULL	mid->next = NULL	Left: 1 -> NULL, Right: 3 -> NULL
13	Sort right-left half	1 node: 1->NULL	head points to 1	1 -> NULL
14	Sort right-right half	1 node: 3->NULL	head points to 3	3 -> NULL
15	Merge right halves	2 nodes	merge 1 and 3	1 -> 3 -> NULL
16	Merge sorted halves	4 nodes	merge 2->4 and 1->3	1 -> 2 -> 3 -> 4 -> NULL
17	Return sorted list	4 nodes	head points to 1	1 -> 2 -> 3 -> 4 -> NULL
18	End	Sorted list returned	No pointer changes	1 -> 2 -> 3 -> 4 -> NULL

💡 All nodes merged back in sorted order, recursion ends.

Variable Tracker

Variable	Start	After Step 3	After Step 9	After Step 15	After Step 16	Final
head	4->2->1->3->NULL	Left:4->2->NULL, Right:1->3->NULL	Left sorted:2->4->NULL	Right sorted:1->3->NULL	Merged:1->2->3->4->NULL	1->2->3->4->NULL
mid	points to 2	points to 4 (left half)	points to 4 (left half)	points to 1 (right half)	points to 1 (right half)	N/A
left	N/A	4->2->NULL	2->4->NULL	2->4->NULL	2->4->NULL	2->4->NULL
right	N/A	1->3->NULL	1->3->NULL	1->3->NULL	1->3->NULL	1->3->NULL

Key Moments - 3 Insights

Why do we split the list by setting mid->next = NULL?

Setting mid->next = NULL breaks the list into two separate halves so recursive calls sort each half independently, as shown in step 3 and step 6.

Why does the recursion stop when the list has 0 or 1 node?

A list with 0 or 1 node is already sorted, so the function returns immediately without further splitting, as seen in steps 7 and 8.

How does merging two sorted halves maintain order?

During merge (steps 9, 15, 16), nodes are compared one by one and linked in ascending order, ensuring the merged list is sorted.

Visual Quiz - 3 Questions

Look at the execution table, what is the visual state after step 9?

A 2 -> 4 -> NULL

B 1 -> 3 -> NULL

C 4 -> 2 -> NULL

D 1 -> 2 -> 3 -> 4 -> NULL

💡 Hint

Check the 'Visual State' column at step 9 in the execution table.

At which step does the list get fully merged and sorted?

A Step 9

B Step 16

C Step 15

D Step 3

💡 Hint

Look for the step where the full 4-node list is merged in the execution table.

If the original list had only one node, what would happen in the execution?

A The function would split the list anyway.

B The function would merge with an empty list.

C The function would return the node immediately without splitting.

D The function would cause an error.

💡 Hint

Refer to the base case condition in the code and steps 7 and 8.

Concept Snapshot

Merge Sort on Linked List:
- Base case: 0 or 1 node returns as sorted
- Find middle node to split list
- Recursively sort left and right halves
- Merge two sorted halves by comparing nodes
- Result is a fully sorted linked list

Full Transcript

This visualization shows how merge sort works on a linked list. We start with the full list and find the middle node to split it into two halves. Each half is recursively sorted until we reach lists with one node, which are already sorted. Then, we merge the sorted halves step by step, comparing nodes to maintain order. Pointer changes like setting mid->next to NULL split the list physically. The final merged list is sorted. Key points include why we split the list, when recursion stops, and how merging maintains order.