🐛 chore: back changes

CarlosZoft · CarlosZoft · commit 36bca3d8cca3 · 2023-08-17T16:48:21.000-03:00
diff --git a/Sorts/SimplifiedWiggleSort.js b/Sorts/SimplifiedWiggleSort.js
@@ -8,30 +8,29 @@
 import { quickSelectSearch } from '../Search/QuickSelectSearch.js'
 
 export const simplifiedWiggleSort = function (arr) {
-  const arrSize = arr.length
   // find Median using QuickSelect
-  let median = quickSelectSearch(arr, Math.floor(arrSize / 2.0))
-  median = median[Math.floor(arrSize / 2.0)]
+  let median = quickSelectSearch(arr, Math.floor(arr.length / 2.0))
+  median = median[Math.floor(arr.length / 2.0)]
 
-  const sorted = new Array(arrSize)
+  const sorted = new Array(arr.length)
 
   let smallerThanMedianIndx = 0
-  let greaterThanMedianIndx = arrSize - 1 - (arrSize % 2)
+  let greaterThanMedianIndx = arr.length - 1 - (arr.length % 2)
 
-  arr.forEach(element => {
-    if (element > median) {
-      sorted[greaterThanMedianIndx] = element
+  for (let i = 0; i < arr.length; i++) {
+    if (arr[i] > median) {
+      sorted[greaterThanMedianIndx] = arr[i]
       greaterThanMedianIndx -= 2
     } else {
-      if (smallerThanMedianIndx < arrSize) {
-        sorted[smallerThanMedianIndx] = element
+      if (smallerThanMedianIndx < arr.length) {
+        sorted[smallerThanMedianIndx] = arr[i]
         smallerThanMedianIndx += 2
       } else {
-        sorted[greaterThanMedianIndx] = element
+        sorted[greaterThanMedianIndx] = arr[i]
         greaterThanMedianIndx -= 2
       }
     }
-  })
+  }
 
   return sorted
 }
