Fix the insertion sort (trekhleb#86)

m-maksyutin · trekhleb · commit d82958dea9d8 · 2018-07-03T11:56:34.000+03:00
* Fix LinkedList

* Fix the prepend method for the LinkedList

* Fix the remove method for the MinHeap

* Correct a comment

* Fix BST removal method

* Fix the findEdge method of the graph

* Fix the value returned by DisjointSet union

* Add recursive factorial function

* Fix the insertion sort
diff --git a/src/algorithms/sorting/insertion-sort/InsertionSort.js b/src/algorithms/sorting/insertion-sort/InsertionSort.js
@@ -14,7 +14,7 @@ export default class InsertionSort extends Sort{
 // Go and check if previous elements and greater then current one.
 // If this is the case then swap that elements.
 while (
- array[currentIndex - 1] &&
+ array[currentIndex - 1] !== undefined &&
 this.comparator.lessThan(array[currentIndex], array[currentIndex - 1])
 ){
 // Call visiting callback.

-Original file line number
+Diff line change
 // Go and check if previous elements and greater then current one.
 // If this is the case then swap that elements.
 while(
 -array[currentIndex-1]&&
 +array[currentIndex-1]!==undefined&&
 this.comparator.lessThan(array[currentIndex],array[currentIndex-1])
 ){
 // Call visiting callback.