Is the number of moves counted correctly in insertion sort?

Question

Algorithms

Insertion sorting of an array is implemented in JavaScript:

const sort = (arr) => {
  let compCounter = 0; // счетчик сравнений
  let movementCounter = 0; // счетчик перемещений элементов
  const arrLength = arr.length;
  
  for (let i = 1; i < arrLength; i++) {
    for (let j = i; j > 0; j--) {
      if (arr[j - 1] > arr[j]) { 
        const temp = arr[j - 1];
        arr[j - 1] = arr[j];
        arr[j] = temp;
        movementCounter += 3;
      }

      compCounter += 1;
    }    
  }
  
  console.log('Количество сравнений: ', compCounter);
  console.log('Количество перемещений: ', movementCounter);
};

If elements are being moved, then the counter is incremented by 3 because there are 3 operations on the elements.

For an array with a thousand elements, the following average results are obtained:

Number of comparisons: 4950 (always the same)
Number of moves: 7896 (floats around 6000-8000).

Question: am I counting the number of movements correctly?

Answer 1

If elements are moved, the counter is incremented by 3 because there are 3 element operations.

And if the exchange were implemented like this: Or even like this:
[ arr[j - 1], arr[j] ] = [ arr[j], arr[j - 1] ];

swap(arr, j - 1, j); // функция меняет местами элементы, но как именно - вам неизвестно

By how much would you increment the counter? Don't need 3, write 1. Treat the exchange as a single operation.