vophihungvn
diff --git a/‎chapter10/01-SortingAlgorithms.js ‎chapter10/01-SortingSearchingAlgorithms.js
+61 b/‎chapter10/01-SortingAlgorithms.js ‎chapter10/01-SortingSearchingAlgorithms.js
+61
diff --git a/‎chapter10/02-UsingSortingAlgorithms.html
+1-1 b/‎chapter10/02-UsingSortingAlgorithms.html
+1-1
diff --git a/‎chapter10/03-UsingSearchingAlgorithms.html
+11 b/‎chapter10/03-UsingSearchingAlgorithms.html
+11
diff --git a/‎chapter11/02-UsingSearchingAlgorithms.js ‎chapter10/03-UsingSearchingAlgorithms.js b/‎chapter11/02-UsingSearchingAlgorithms.js ‎chapter10/03-UsingSearchingAlgorithms.js
diff --git a/‎chapter11/01-SearchingAlgorithms.js
-128 b/‎chapter11/01-SearchingAlgorithms.js
-128
diff --git a/‎chapter11/02-UsingSearchingAlgorithms.html
-11 b/‎chapter11/02-UsingSearchingAlgorithms.html
-11
@@ -24,6 +24,7 @@ function ArrayList(){
         var length = array.length;
 
         for (var i=0; i<length; i++){
+            console.log('--- ');
             for (var j=0; j<length-1; j++ ){
                 console.log('compare ' + array[j] + ' with ' + array[j+1]);
                 if (array[j] > array[j+1]){
@@ -38,6 +39,7 @@ function ArrayList(){
         var length = array.length;
 
         for (var i=0; i<length; i++){
+            console.log('--- ');
             for (var j=0; j<length-1-i; j++ ){
                 console.log('compare ' + array[j] + ' with ' + array[j+1]);
                 if (array[j] > array[j+1]){
@@ -191,4 +193,63 @@ function ArrayList(){
         }
         return array;
     };
+
+    this.sequentialSearch = function(item){
+
+        for (var i=0; i<array.length; i++){
+            if (item === array[i]){
+                return i;
+            }
+        }
+
+        return -1;
+    };
+
+    this.findMaxValue = function(){
+        var max = array[0];
+        for (var i=1; i<array.length; i++){
+            if (max < array[i]){
+                max = array[i];
+            }
+        }
+
+        return max;
+    };
+
+    this.findMinValue = function(){
+        var min = array[0];
+        for (var i=1; i<array.length; i++){
+            if (min > array[i]){
+                min = array[i];
+            }
+        }
+
+        return min;
+    };
+
+    this.binarySearch = function(item){
+        this.quickSort();
+
+        var low = 0,
+            high = array.length - 1,
+            mid, element;
+
+        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;
+            }
+        }
+        return -1;
+    };
+
 }
@@ -5,7 +5,7 @@
     <title></title>
 </head>
 <body>
-<script type="text/javascript" src="01-SortingAlgorithms.js"></script>
+<script type="text/javascript" src="01-SortingSearchingAlgorithms.js"></script>
 <script type="text/javascript" src="02-UsingSortingAlgorithms.js"></script>
 </body>
 </html>
@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+<script type="text/javascript" src="01-SortingSearchingAlgorithms.js"></script>
+<script type="text/javascript" src="03-UsingSearchingAlgorithms.js"></script>
+</body>
+</html>