Method One:
Using the Insert Sort method
function mysort () { vartags =New Array();//using arrays as parameters to store containerstags[0]=arguments[0]; for(varI=1;i<arguments. length;i++) { for(varj=0; j<tags.length;j++) {if(arguments[I]<tags[j]) { for(vark=tags.length-1; k>j;k--) {tags[k+1]=TAGS[K]; } tags[j+1]=TAGS[J]; tags[j]=arguments[i]; Break; } } }returntags;} Mysort (Ten,6,8,3,1, A);
Method Two
The sort () method that comes with the array object that uses JavaScript
function mysort () { vartags =New Array();//using arrays as parameters to store containers for(vari =0; I <arguments. length;i++) {Tags.push (arguments[i]); } tags.sort ( function sortnumber(A, B){returnA-B});returnTags }varResult=mysort (Ten,6,8,3,1, A); Console.log (result);
Front-End Pen test notes: Enable Mysort () to show incoming parameters in order from small to large.