Quick Sort on Linked List

In this video, I explain how to sort a Linked List using the Quick Sort algorithm in Python.

Unlike arrays, linked lists don’t allow random access, so we can’t swap elements directly. Instead, this approach uses pointer manipulation to partition the list around a pivot and recursively sort the sublists.

💡 What you’ll learn:
How Quick Sort works on a Linked List
Choosing a pivot node
Partitioning into left and right sublists
Recursive sorting of linked lists
Merging the sorted parts
🚀 Approach:
Select the first node as pivot
Create two lists:
Nodes smaller than pivot
Nodes greater than or equal to pivot
Recursively sort both lists
Combine: Left → Pivot → Right
⏱️ Time Complexity:
Average: O(n log n)
Worst: O(n²

Видео Quick Sort on Linked List канала Xll BMohammed yusuf