Given a doubly linked list, write a function to sort the doubly linked list in increasing order using merge sort.
For example, the following doubly linked list should be changed to 2<->4<->8<->10
Merge sort for singly linked list is already discussed. The important change here is to modify the previous pointers also when merging two lists.
Below is the implementation of merge sort for doubly linked list.
Linked List after sorting Forward Traversal using next pointer 3 4 5 10 20 30 Backward Traversal using prev pointer 30 20 10 5 4 3
Thanks to Goku for providing above implementation in a comment here.
Time Complexity: Time complexity of the above implementation is same as time complexity of MergeSort for arrays. It takes Θ(nLogn) time.
You may also like to see QuickSort for doubly linked list
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
- Bubble Sort On Doubly Linked List
- Sort the biotonic doubly linked list | Set-2
- Sort a k sorted doubly linked list
- Insertion Sort for Doubly Linked List
- Sort the biotonic doubly linked list
- Iterative Merge Sort for Linked List
- Why Quick Sort preferred for Arrays and Merge Sort for Linked Lists?
- XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
- XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
- Merge a linked list into another linked list at alternate positions
- Merge Sort for Linked Lists
- Union and Intersection of two linked lists | Set-2 (Using Merge Sort)
- Reverse a Doubly Linked List
- Reverse a Doubly Linked List | Set-2