insertionsort.js

function insertionSort(arr) {
  let totalActions = 0;
  for (let i = 0; i < arr.length; i++) {
    totalActions++;
    let smallestIndex = i;
    for (let j = i + 1; j < arr.length; j++) {
      totalActions++;
      if (arr[j] < arr[smallestIndex]) {
        smallestIndex = j;
        totalActions++;
      }
    }
    let tmp = arr[smallestIndex];
    totalActions++;
    arr[smallestIndex] = arr[i];
    totalActions++;
    arr[i] = tmp;
    totalActions++;
  }
  console.log(`${totalActions} total actions`);
  return arr;
}