<pre class="shiki github-dark shaku"><code>/** * @param {number[]} arr */function insertionSort(arr) { for (let i = 1; i &lt; arr.length; i++) { const insertIdx = findInsertIdx(arr, i - 1, arr[i]) const [target] = arr.splice(i, 1) arr.splice(insertIdx, 0, target) }}function findInsertIdx(arr, end, target) { if (arr[0] &gt; target) { return 0 } if (arr[end] &lt; target) { return Math.min(arr.length - 1, end + 1) } let lo = 0 let hi = end while (lo &lt;= hi) { const mid = ((hi - lo) &gt;&gt; 1) + lo if (arr[mid] === target) { return mid } if (arr[mid] &lt; target) { lo = mid + 1 } else { hi = mid - 1 } } return lo}</code></pre>

This is my solution

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