added chapter 11

Author: loiane

chapter11/01-SearchingAlgorithms.js

@@ -57,11 +57,15 @@ function ArrayList(){
         while (low <= high){
             mid = Math.floor((low + high) / 2);
             element = array[mid];
+            console.log('mid element is ' + element);
             if (element < item) {
                 low = mid + 1;
+                console.log('low is ' + low);
             } else if (element > item) {
                 high = mid - 1;
+                console.log('high is ' + high);
             } else {
+                console.log('found it');
                 return mid;
             }
         }

chapter11/02-UsingSearchingAlgorithms.js

@@ -1,14 +1,14 @@
-function createNonSortedArray(){
+function createNonSortedArray(items){
     var array = new ArrayList();
 
-    for (var i = 5; i> 0; i--){
+    for (var i = items; i> 0; i--){
         array.insert(i);
     }
 
     return array;
 }
 
-var array = createNonSortedArray();
+var array = createNonSortedArray(5);
 
 console.log('********** Sequential Sort #3 **********');
 
@@ -24,4 +24,10 @@ console.log(array.findMaxValue());
 
 console.log('********** Binary Search #3 **********');
 
-console.log(array.binarySearch(3));
+console.log(array.binarySearch(3));
+
+console.log('********** Binary Search #2 **********');
+
+var array = createNonSortedArray(8);
+
+console.log(array.binarySearch(2));