Following is a typical recursive implementation of QuickSort for arrays. The implementation uses last element as pivot.
Can we use the same algorithm for Linked List?
Following is C++ implementation for the doubly linked list. The idea is simple, we first find out pointer to the last node. Once we have a pointer to the last node, we can recursively sort the linked list using pointers to first and last nodes of a linked list, similar to the above recursive function where we pass indexes of first and last array elements. The partition function for a linked list is also similar to partition for arrays. Instead of returning index of the pivot element, it returns a pointer to the pivot element. In the following implementation, quickSort() is just a wrapper function, the main recursive function is _quickSort() which is similar to quickSort() for array implementation.
Linked List before sorting 30 3 4 20 5 Linked List after sorting 3 4 5 20 30
Time Complexity: Time complexity of the above implementation is same as time complexity of QuickSort() for arrays. It takes O(n^2) time in the worst case and O(nLogn) in average and best cases. The worst case occurs when the linked list is already sorted.
Can we implement random quicksort for a linked list?
Quicksort can be implemented for Linked List only when we can pick a fixed point as the pivot (like the last element in the above implementation). Random QuickSort cannot be efficiently implemented for Linked Lists by picking random pivot.
The above implementation is for a doubly linked list. Modify it for a singly linked list. Note that we don’t have prev pointer in a singly linked list.
Refer QuickSort on Singly Linked List for solution.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- QuickSort on Singly Linked List
- XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
- Difference between Singly linked list and Doubly linked list
- XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
- Construct a Doubly linked linked list from 2D Matrix
- Reverse a Doubly Linked List | Set-2
- Doubly Linked List Tutorial
- Reverse a Doubly Linked List
- Reverse a doubly circular linked list
- Find pairs with given sum in doubly linked list
- Doubly Circular Linked List | Set 2 (Deletion)
- Reverse a Doubly linked list using recursion
- Sort a k sorted doubly linked list
- Rotate Doubly linked list by N nodes
- Doubly Linked List | Set 1 (Introduction and Insertion)
- Sort the biotonic doubly linked list | Set-2
- Delete all occurrences of a given key in a doubly linked list
- Merge Sort for Doubly Linked List
- Delete all the even nodes from a Doubly Linked List
- Sort the biotonic doubly linked list