<pre class="shiki github-dark shaku"><code>/** * @param {number[]} arr */function quickSort(arr, low = 0, high = arr.length - 1) { if (low &lt; high) { const pivotIdx = partition(arr, low, high); quickSort(arr, low, pivotIdx - 1); quickSort(arr, pivotIdx + 1, high); }}function partition(arr, low, high) { const pivot = arr[low]; let [leftPtr, rightPtr] = [low, high]; while (leftPtr &lt; rightPtr) { while (arr[leftPtr] &lt;= pivot &amp;&amp; leftPtr &lt;= high - 1) { // find the first element from right which is greater than pivot leftPtr++; } while (arr[rightPtr] &gt; pivot &amp;&amp; rightPtr &gt;= low + 1) { // find the first element from right which is smaller than pivot rightPtr--; } if (leftPtr &lt; rightPtr) { // if ptrs haven't yet crossed then swap [arr[leftPtr], arr[rightPtr]] = [arr[rightPtr], arr[leftPtr]]; } } // place the pivot at the right position [arr[low], arr[rightPtr]] = [arr[rightPtr], arr[low]]; return rightPtr;}</code></pre>

O(n * logn) average time complexity, O(1) space complexity, Stable sort

Even for Front-End Engineer, it is a must to understand how basic sorting algorithms work. Now you are asked to implement Quick Sort, which sorts an i…