Prerequisite: Merge Sort for Linked Lists
Merge sort is often preferred for sorting a linked list. The slow random-access performance of a linked list makes some other algorithms (such as quicksort) perform poorly, and others (such as heapsort) completely impossible.
Input : 5 -> 4 -> 3 -> 2 -> 1
Output :1 -> 2 -> 3 -> 4 -> 5
Input : 10 -> 20 -> 3 -> 2 -> 1
Output : 1 -> 2 -> 3 -> 10 -> 20
10 -> 20 -> 3 -> 2 -> 1 After sorting : 1 -> 2 -> 3 -> 10 -> 20
- Why Quick Sort preferred for Arrays and Merge Sort for Linked Lists?
- Merge Sort for Linked Lists
- Union and Intersection of two linked lists | Set-2 (Using Merge Sort)
- Difference of two Linked Lists using Merge sort
- Merge Sort with O(1) extra space merge and O(n lg n) time
- Merge two sorted linked lists such that merged list is in reverse order
- In-place Merge two linked lists without changing links of first list
- Merge k sorted linked lists | Set 2 (Using Min Heap)
- Sorted merge of two sorted doubly circular linked lists
- Merge odd and even positioned nodes of two Linked Lists alternately
- Merge two sorted linked lists
- Merge K sorted linked lists | Set 1
- Merge two unsorted linked lists to get a sorted list
- Quick Sort vs Merge Sort
- Merge Sort vs. Insertion Sort
- Merge Sort for Doubly Linked List
- Iterative Merge Sort for Linked List
- Merge a linked list into another linked list at alternate positions
- Construct a Maximum Sum Linked List out of two Sorted Linked Lists having some Common nodes
- Create a linked list from two linked lists by choosing max element at each position
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.