<pre class="shiki github-dark shaku"><code>/** * @param {number[]} arr */function selectionSort(arr) { // your code here let temp; //selection sort, i = 0; i &lt; arr.length-1, j = i+1 to j &lt; arr.length for (let i = 0; i &lt; arr.length - 1; i++) { for (let j = i + 1; j &lt; arr.length; j++) if (arr[i] &gt; arr[j]) { temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } } return arr;}</code></pre>

basic o(n2)

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