Quick Sort is a sorting algorithm with a need for speed. It's like a high-speed train that zooms through your array, leaving no element un-turned.
Here's the basic idea:
<img src="https://example.com/quick-sort-flowchart.png" alt="A flowchart of Quick Sort" width="500" height="500"/>>
Choose a random element as the pivot, and recursively sort the subarray on one side of it.
Suboptimal Pivot Choice: The Dark Side of Quick Sort
Want to see how it works in action? Click here to see a visual representation.