<pre class="shiki github-dark shaku"><code>/** * @param {number[]} arr */function insertionSort(arr) { // your code here let key; let j; for(let i=1; i&lt;arr.length; i++){ key = arr[i]; j = i - 1; while(j&gt;=0 &amp;&amp; arr[j]&gt;key){ arr[j+1]=arr[j]; j=j-1; } arr[j+1] = key; } return arr;}</code></pre>

o(n2) worst case complexity

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 …