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

My Simple and Accepted Solution

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