The #sorting-algorithms series is a collection of posts about reimplemented sorting algorithms in JavaScript. If you are not familiar with sorting algorithms, a quick introduction and the full list of ...

Quick Sorts use a partition value similar to a merge sort in that it divides and conquers. Partition the array by defining a Pivot value. Sort everything less than the Pivot to the left, and ...