added chapter 11

loiane · loiane · commit 648abe9b5bbd · 2014-08-08T12:15:04.000-03:00
diff --git a/chapter11/01-SearchingAlgorithms.js b/chapter11/01-SearchingAlgorithms.js
@@ -0,0 +1,124 @@
+function ArrayList(){
+
+    var array = [];
+
+    this.insert = function(item){
+        array.push(item);
+    };
+
+    this.toString = function(){
+        var s = array[0] ? array[0] : '';
+        for (var i=1; i<array.length; i++){
+            s += ', ' + array[i];
+        }
+        return s;
+    };
+
+    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];
+            if (element < item) {
+                low = mid + 1;
+            } else if (element > item) {
+                high = mid - 1;
+            } else {
+                return mid;
+            }
+        }
+        return -1;
+    };
+
+    this.quickSort = function(){
+        quick(array,  0, array.length - 1);
+    };
+
+    var partition = function(array, left, right) {
+
+        var pivot = array[Math.floor((right + left) / 2)],
+            i = left,
+            j = right;
+
+        while (i <= j) {
+            while (array[i] < pivot) {
+                i++;
+            }
+
+            while (array[j] > pivot) {
+                j--;
+            }
+
+            if (i <= j) {
+                swapQuickStort(array, i, j);
+                i++;
+                j--;
+            }
+        }
+
+        return i;
+    };
+
+    var swapQuickStort = function(array, index1, index2){
+        var aux = array[index1];
+        array[index1] = array[index2];
+        array[index2] = aux;
+    };
+
+    var quick = function(array, left, right){
+
+        var index;
+
+        if (array.length > 1) {
+
+            index = partition(array, left, right);
+
+            if (left < index - 1) {
+                quick(array, left, index - 1);
+            }
+
+            if (index < right) {
+                quick(array, index, right);
+            }
+        }
+        return array;
+    };
+}
diff --git a/chapter11/02-UsingSearchingAlgorithms.html b/chapter11/02-UsingSearchingAlgorithms.html
@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+<script type="text/javascript" src="01-SearchingAlgorithms.js"></script>
+<script type="text/javascript" src="02-UsingSearchingAlgorithms.js"></script>
+</body>
+</html>
diff --git a/chapter11/02-UsingSearchingAlgorithms.js b/chapter11/02-UsingSearchingAlgorithms.js
@@ -0,0 +1,27 @@
+function createNonSortedArray(){
+    var array = new ArrayList();
+
+    for (var i = 5; i> 0; i--){
+        array.insert(i);
+    }
+
+    return array;
+}
+
+var array = createNonSortedArray();
+
+console.log('********** Sequential Sort #3 **********');
+
+console.log(array.sequentialSearch(3));
+
+console.log('********** Min **********');
+
+console.log(array.findMinValue());
+
+console.log('********** Max **********');
+
+console.log(array.findMaxValue());
+
+console.log('********** Binary Search #3 **********');
+
+console.log(array.binarySearch(3));
