Definition

Quick Sort is an algorithm that picks a pivot (reference point), splits values smaller than the pivot to the left and larger to the right, then sorts both sides the same way.

Key Characteristics

• ✓Divide and Conquer - Break big problem into smaller problems
• ✓Average time O(n log n), worst case O(n²) - Usually fast, but slow if pivot is poorly chosen
• ✓In-Place Sorting - Requires very little extra memory
• ✓Unstable Sort - Order of equal values may change
• ✓One of the fastest sorts in practice - Uses cache efficiently

Time Complexity