forked from loiane/javascript-datastructures-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path05-BigONotation.js
65 lines (54 loc) · 1.4 KB
/
05-BigONotation.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
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);