src/algorithms/sorting/insertion-sort/InsertionSort.js

@@ -7,31 +7,26 @@ export default class InsertionSort extends Sort {
     // Go through all array elements...
     for (let i = 0; i < array.length; i += 1) {
       let currentIndex = i;
+      const valueAtIndex = array[i];
 
       // Call visiting callback.
       this.callbacks.visitingCallback(array[i]);
 
       // Go and check if previous elements and greater then current one.
       // If this is the case then swap that elements.
-      while (
-        array[currentIndex - 1] !== undefined
-        && this.comparator.lessThan(array[currentIndex], array[currentIndex - 1])
+      while (currentIndex > 0
+        && this.comparator.lessThan(valueAtIndex, array[currentIndex - 1])
       ) {
         // Call visiting callback.
         this.callbacks.visitingCallback(array[currentIndex - 1]);
 
-        // Swap the elements.
-        [
-          array[currentIndex - 1],
-          array[currentIndex],
-        ] = [
-          array[currentIndex],
-          array[currentIndex - 1],
-        ];
+        array[currentIndex] = array[currentIndex - 1];
 
         // Shift current index left.
         currentIndex -= 1;
       }
+
+      array[currentIndex] = valueAtIndex;
     }
 
     return array;