<pre class="shiki github-dark shaku"><code>/** * @param {number[]} arr */function quickSort(arr, left = 0, right = arr.length) { // your code here if(left &lt; right) { let pivot = partition(arr, left, right) quickSort(arr, left, pivot - 1) quickSort(arr, pivot + 1, right) }}function partition(arr, left, right) { let pivot = left, index = pivot + 1 for(let i = index; i &lt;= right; i++) { if(arr[pivot] &gt; arr[i]) { swap(arr, i, index) index++ } } swap(arr, pivot, index - 1) return index - 1}function swap(arr, left, right) { [arr[left], arr[right]] = [arr[right], arr[left]]}</code></pre>

This is my answer

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…