Quick Sort is a mostly efficient sorting algorithm. In its most basic form, it works by selecting a pivot, partitioning the array around it, and recursively applying the algorithm to both sides of the pivot.
However, in this totally-not-at-all exhaustive guide, we're going to focus on the more interesting part: Quick Sort Iteration Explanation
Want to know more about how to select a good Pivot Element?
Or, if you're a performance connoisseur, we have some graphs for you!
And, if you're still having trouble with your sorting algorithm, try asking Quick Sort Debugging Tips!
Or, if all else fails, Bail, Sort, and Pray.