Colors: Orange = Pivot, Blue = Lower, Purple = Upper, Yellow = Comparing, Light Blue = Sublist, Green = Sorted
Quick Sort is a divide-and-conquer sorting algorithm that selects a pivot element and partitions the array around it, then recursively sorts the subarrays.
How it works:
Time Complexity: O(n log n) average, O(n²) worst case