Insertion Sort using Javascript

let mine=[45,3,22,5,88,7,999,6,97];

for(let i=1;i<mine.length;i++)
{
   var current=mine[i];
   var j=i-1;
   
   while(j>=0 && mine[j]>current)
   {
       mine[j+1]=mine[j];
       j--;
   }
   mine[j+1]=current;
}

console.log(mine);

JavaScript

INFO

Quick actions

Insertion Sort using Javascript

Snippet info