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

AndrewLawendy · AndrewLawendy · commit e33bda6d5f7b · 2022-07-23T15:21:40.000+02:00
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];
     }

Original file line number	Diff line number	Diff line change
`@@ -14,7 +14,7 @@ function insertionSort(nums) {`
`14`	`14`	`let j; // the inner counter`
`15`	`15`
`16`	`16`	`// loop from the right to the left`
`17`		`- for (j = i - 1; nums[j] > numberToInsert && j >= 0; j--) {`
	`17`	`+ for (j = i - 1; nums[j] > numberToInsert; j--) {`
`18`	`18`	`// move numbers to the right until we find where to insert`
`19`	`19`	`nums[j + 1] = nums[j];`
`20`	`20`	`}`