Algorithms and Data Structures - Quick Sort Characteristics Time complexity: Best: Ω(n log(n)) Average: Θ(n log(n)) Worst: O(n^2) -> When the pivot is the smallest or largest element Space complexity: Best: Ω(log(n)) Average: Θ(log(n)) Worst: O(n) In-place Unstable Demos: With Recursion v1 With Recursion v2 With Iteration Demonstration Algorithm Visualizer Algorithm Visualizer - Usfca References Other Algorithms & Data Structures