refactor(insertion-sort): ♻️ no need to check on j <= 0

any trythy >= undefined anyway
btholt · Jul 23, 2022 · 6aa7668 · 6aa7668
1 parent 5b2edb0
commit 6aa7668
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/specs/insertion-sort/insertion-sort.solution.test.js b/specs/insertion-sort/insertion-sort.solution.test.js
@@ -14,7 +14,7 @@ function insertionSort(nums) {
     let j; // the inner counter
 
     // loop from the right to the left
-    for (j = i - 1; nums[j] > numberToInsert && j >= 0; j--) {
+    for (j = i - 1; nums[j] > numberToInsert; j--) {
       // move numbers to the right until we find where to insert
       nums[j + 1] = nums[j];
     }