<pre class="shiki github-dark shaku"><code>/** * @param {number[]} arr */function mergeSort(arr) { // your code here function merge(array, l, mid, r) { let left = array.slice(l, mid + 1) let right = array.slice(mid + 1, r + 1) let i = l let j = 0 let k = 0 while (j &lt; left.length &amp;&amp; k &lt; right.length) { if (left[j] &lt;= right[k]) { array[i] = left[j] j++ } else { array[i] = right[k] k++ } i++ } while (j &lt; left.length) { arr[i] = left[j] j++ i++ } while (k &lt; right.length) { arr[i] = right[k] k++ i++ } } function sort(array, l, r) { if (l === r) { return array } let mid = Math.floor((r + l) / 2) sort(array, l, mid) sort(array, mid + 1, r) merge(array, l, mid, r) return array } return sort(arr, 0, Math.max(arr.length - 1, 0))}</code></pre>

neetcode solution

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