Algorithm Complexity

loiane · loiane · commit 0c0a8967fb66 · 2018-04-24T20:29:21.000-04:00
diff --git a/examples/chapter15/01-BigONotation.html b/examples/chapter15/01-BigONotation.html
@@ -0,0 +1,10 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+<script type="text/javascript" src="05-BigONotation.js"></script>
+</body>
+</html>
diff --git a/examples/chapter15/01-BigONotation.js b/examples/chapter15/01-BigONotation.js
@@ -0,0 +1,65 @@
+//*************** o(1)
+function increment(num){
+    console.log('cost for increment with input ' + num + ' is 1');
+    return  ++num;
+}
+
+increment(1);
+increment(2);
+
+//*************** o(n)
+
+function createNonSortedArray(size){
+    var array = [];
+
+    for (var i = size; i> 0; i--){
+        array[i] = i;
+    }
+
+    return array;
+}
+
+function sequentialSearch(array, item){
+    var cost = 0;
+    for (var i=0; i<array.length; i++){
+        cost++;
+        if (item === array[i]){ //{1}
+            return i;
+        }
+    }
+    console.log('cost for sequentialSearch with input size ' + array.length + ' is ' + cost);
+    return -1;
+}
+
+var array = createNonSortedArray(99);
+sequentialSearch(array, -1);
+
+//*************** o(nˆ2)
+
+function swap(array, index1, index2){
+    var aux = array[index1];
+    array[index1] = array[index2];
+    array[index2] = aux;
+}
+
+function bubbleSort(array){
+    var length = array.length;
+    var cost = 0;
+    for (var i=0; i<length; i++){ //{1}
+        cost++;
+        for (var j=0; j<length-1; j++ ){ //{2}
+            cost++;
+            if (array[j] > array[j+1]){
+                swap(array, j, j+1);
+            }
+        }
+    }
+    console.log('cost for bubbleSort with input size ' + length + ' is ' + cost);
+}
+
+var array1 = createNonSortedArray(99);
+var array2 = createNonSortedArray(999);
+var array3 = createNonSortedArray(9999);
+bubbleSort(array1);
+bubbleSort(array2);
+bubbleSort(array3);
diff --git a/examples/chapter15/bigOChart/chart.js b/examples/chapter15/bigOChart/chart.js
@@ -0,0 +1,37 @@
+google.load('visualization', '1.0', {'packages':['corechart']});
+google.setOnLoadCallback(drawChart);
+
+function drawChart() {
+
+    var data = new google.visualization.DataTable();
+    data.addColumn('string', 'n');
+    data.addColumn('number', 'O(1)');
+    data.addColumn('number', 'O(log n)');
+    data.addColumn('number', 'O(n)');
+    data.addColumn('number', 'O(n log n)');
+    data.addColumn('number', 'O(n^2)');
+    data.addColumn('number', 'O(2^n)');
+
+    for (var i = 0; i <= 30; i++) {
+        data.addRow([i+'', 1, Math.log(i), i, Math.log(i)*i, Math.pow(i,2), Math.pow(2,i)]);
+    }
+
+    var options = {'title':'Big O Notation Complexity Chart',
+        'width':700,
+        'height':600,
+        'backgroundColor':{stroke:'#CCC',strokeWidth:1},
+        'curveType':'function',
+        'hAxis':{
+            title:'Elements (n)',
+            showTextEvery:5
+        },
+        'vAxis':{
+            title:'Operations',
+            viewWindowMode:'explicit',
+            viewWindow:{min:0,max:450}
+        }
+    };
+
+    var chart = new google.visualization.LineChart(document.getElementById('chart_div'));
+    chart.draw(data, options);
+}
