make binary_search easier to understand

64json · 64json · commit f665f9e76829 · 2016-05-22T04:23:07.000-05:00
diff --git a/algorithm/search/binary_search/iterative/code.js b/algorithm/search/binary_search/iterative/code.js
@@ -1,17 +1,17 @@
-function BinarySearch(array, element) { // array = sorted array, element = element to be found,
-
+function BinarySearch(array, element) { // array = sorted array, element = element to be found
     var minIndex = 0;
     var maxIndex = array.length - 1;
-    var currentIndex;
     var testElement;
 
     while (minIndex <= maxIndex) {
 
-        middleIndex = Math.floor((minIndex + maxIndex) / 2);
+        var middleIndex = Math.floor((minIndex + maxIndex) / 2);
         testElement = array[middleIndex];
 
         tracer._print('Searching at index: ' + middleIndex);
+        tracer._selectSet([minIndex, maxIndex]);
         tracer._notify(middleIndex);
+        tracer._deselectSet([minIndex, maxIndex]);
 
         if (testElement < element) {
 
diff --git a/algorithm/search/binary_search/recursive/code.js b/algorithm/search/binary_search/recursive/code.js
@@ -8,7 +8,9 @@ function BinarySearch(array, element, minIndex, maxIndex) { // array = sorted ar
     var testElement = array[middleIndex];
 
     tracer._print('Searching at index: ' + middleIndex);
+    tracer._selectSet([minIndex, maxIndex]);
     tracer._notify(middleIndex);
+    tracer._deselectSet([minIndex, maxIndex]);
 
     if (testElement < element) {
         tracer._print('Going right.');
