TheAlgorithms · itsvinayak · May 23, 2020 · May 22, 2020 · May 22, 2020
@@ -59,9 +59,7 @@ function getRandomInt (min, max) {
 }
 
 function Swap (arr, x, y) {
-  const temp = arr[x]
-  arr[x] = arr[y]
-  arr[y] = temp
+  [arr[x], arr[y]] = [arr[y], arr[x]]
 }
 
 // testing

@@ -12,9 +12,7 @@ function bubbleSort (items) {
       // Compare the adjacent positions
       if (items[j] < items[j - 1]) {
         // Swap the numbers
-        const tmp = items[j]
-        items[j] = items[j - 1]
-        items[j - 1] = tmp
+        [items[j], items[j - 1]] = [items[j - 1], items[j]]
       }
     }
   }
@@ -47,9 +45,7 @@ function alternativeBubbleSort (arr) {
     swapped = false
     for (let i = 0; i < arr.length - 1; i++) {
       if (arr[i] > arr[i + 1]) {
-        const temp = arr[i]
-        arr[i] = arr[i + 1]
-        arr[i + 1] = temp
+        [arr[i], arr[i + 1]] = [arr[i + 1], arr[i]]
         swapped = true
       }
     }

@@ -7,24 +7,20 @@
 function cocktailShakerSort (items) {
   for (let i = items.length - 1; i > 0; i--) {
     let swapped = false
-    let temp, j
+    let j
 
     // backwards
     for (j = items.length - 1; j > i; j--) {
       if (items[j] < items[j - 1]) {
-        temp = items[j]
-        items[j] = items[j - 1]
-        items[j - 1] = temp
+        [items[j], items[j - 1]] = [items[j - 1], items[j]]
         swapped = true
       }
     }
 
     // forwards
     for (j = 0; j < i; j++) {
       if (items[j] > items[j + 1]) {
-        temp = items[j]
-        items[j] = items[j + 1]
-        items[j + 1] = temp
+        [items[j], items[j + 1]] = [items[j + 1], items[j]]
         swapped = true
       }
     }

@@ -33,9 +33,7 @@ function combSort (list) {
 
     while (gap + i < list.length) {
       if (list[i] > list[i + gap]) {
-        const value = list[i]
-        list[i] = list[i + gap]
-        list[i + gap] = value
+        [list[i], list[i + gap]] = [list[i + gap], list[i]]
         isSwapped = true
       }
       i += 1

@@ -14,9 +14,7 @@ function gnomeSort (items) {
     if (items[i - 1] <= items[i]) {
       i++
     } else {
-      const temp = items[i]
-      items[i] = items[i - 1]
-      items[i - 1] = temp
+      [items[i], items[i - 1]] = [items[i - 1], items[i]]
 
       i = Math.max(1, i - 1)
     }

@@ -22,10 +22,7 @@ function heapRoot (input, i) {
 }
 
 function swap (input, indexA, indexB) {
-  const temp = input[indexA]
-
-  input[indexA] = input[indexB]
-  input[indexB] = temp
+  [input[indexA], input[indexB]] = [input[indexB], input[indexA]]
 }
 
 function heapSort (input) {

@@ -21,9 +21,7 @@ function selectionSort (items) {
     if (min !== i) {
       // After each pass, if the current min num != initial min num, exchange the position.
       // Swap the numbers
-      var tmp = items[i]
-      items[i] = items[min]
-      items[min] = tmp
+      [items[i], items[min]] = [items[min], [items[i]]]
     }
   }
 }