Run results for: native sort vs insertion vs selection

Run details:

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/102.0.5005.61 Safari/537.36

Browser: Chrome 102

Operating system: Windows

Device Platform: Desktop

Date tested: one year ago

Test name	Executions per second
sort	47663.2 Ops/sec
insertion sort	37261.8 Ops/sec
select sort	92039.9 Ops/sec

Script Preparation code:

var a=Array.from({length:100},()=>Math.random())

function insertionSort(arr){
    //Start from the second element.
    for(let i = 1; i < arr.length;i++){

        //Go through the elements behind it.
        for(let j = i - 1; j > -1; j--){
            
            //value comparison using ascending order.
            if(arr[j + 1] < arr[j]){

                //swap
                [arr[j+1],arr[j]] = [arr[j],arr[j + 1]];

            }
        }
    };

  return arr;
}

function selectionSort(arr) {
  let min;

  //start passes.
  for (let i = 0; i < arr.length; i++) {
    //index of the smallest element to be the ith element.
    min = i;

    //Check through the rest of the array for a lesser element
    for (let j = i + 1; j < arr.length; j++) {
      if (arr[j] < arr[min]) {
        min = j;
      }
    }

    //compare the indexes
    if (min !== i) {
      //swap
      [arr[i], arr[min]] = [arr[min], arr[i]];
    }
  }

  return arr;
}

Tests:

sort
var b = a.slice(); b.sort();
insertion sort
var b = a.slice(); insertionSort(b)
select sort
var b = a.slice(); selectionSort(b)

Run results for: native sort vs insertion vs selection

sort

insertion sort

select sort