diff --git a/src/algorithms/sorting/shell-sort/ShellSort.js b/src/algorithms/sorting/shell-sort/ShellSort.js
index cdbba99720..08c92306ff 100644
--- a/src/algorithms/sorting/shell-sort/ShellSort.js
+++ b/src/algorithms/sorting/shell-sort/ShellSort.js
@@ -1,41 +1,39 @@
 import Sort from '../Sort';
 
 export default class ShellSort extends Sort {
-  sort(originalArray) {
-    // Prevent original array from mutations.
-    const array = [...originalArray];
-
-    // Define a gap distance.
-    let gap = Math.floor(array.length / 2);
-
-    // Until gap is bigger then zero do elements comparisons and swaps.
-    while (gap > 0) {
-      // Go and compare all distant element pairs.
-      for (let i = 0; i < (array.length - gap); i += 1) {
-        let currentIndex = i;
-        let gapShiftedIndex = i + gap;
-
-        while (currentIndex >= 0) {
-          // Call visiting callback.
-          this.callbacks.visitingCallback(array[currentIndex]);
-
-          // Compare and swap array elements if needed.
-          if (this.comparator.lessThan(array[gapShiftedIndex], array[currentIndex])) {
-            const tmp = array[currentIndex];
-            array[currentIndex] = array[gapShiftedIndex];
-            array[gapShiftedIndex] = tmp;
-          }
-
-          gapShiftedIndex = currentIndex;
-          currentIndex -= gap;
+    sort(originalArray) {
+        // Prevent original array from mutations.
+        const array = [...originalArray];
+
+        // Define a gap distance.
+        let gap = Math.floor(array.length / 2);
+
+        // Until gap is bigger then zero do elements comparisons and swaps.
+        while (gap > 0) {
+            // Go and compare all distant element pairs.
+            for (let i = 0; i < (array.length - gap); i += 1) {
+                let currentIndex = i;
+                let gapShiftedIndex = i + gap;
+
+                while (currentIndex >= 0) {
+                    // Call visiting callback.
+                    this.callbacks.visitingCallback(array[currentIndex]);
+
+                    // Compare and swap array elements if needed.
+                    if (this.comparator.lessThan(array[gapShiftedIndex], array[currentIndex])) {
+                        [array[currentIndex], array[gapShiftedIndex]] = [array[gapShiftedIndex], array[currentIndex]];
+                    }
+
+                    gapShiftedIndex = currentIndex;
+                    currentIndex -= gap;
+                }
+            }
+
+            // Shrink the gap.
+            gap = Math.floor(gap / 2);
         }
-      }
 
-      // Shrink the gap.
-      gap = Math.floor(gap / 2);
+        // Return sorted copy of an original array.
+        return array;
     }
-
-    // Return sorted copy of an original array.
-    return array;
-  }
-}
+}
\ No newline at end of file