-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinarySearch.js
55 lines (44 loc) · 1.73 KB
/
BinarySearch.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
class BinarySearch {
static iterative(key, orderedVector) {
if (!(orderedVector instanceof Array) || typeof key !== 'number') {
throw new Error("it is necessary to validate the types of data reported.");
}
let inferiorLimit = 0;
let upperLimit = orderedVector.length - 1;
let middle;
while (inferiorLimit <= upperLimit) {
middle = parseInt((inferiorLimit + upperLimit) / 2);
if (key === orderedVector[middle])
return middle;
else if (key < orderedVector[middle])
upperLimit = middle - 1;
else
inferiorLimit = middle + 1;
}
return -1;
}
static recursive(key, orderedVector, leftInferiorLimit, rightUpperLimit) {
if (typeof key !== 'number'
|| !(orderedVector instanceof Array)
|| typeof leftInferiorLimit !== 'number'
|| typeof rightUpperLimit !== 'number') {
throw new Error("it is necessary to validate the types of data reported.");
}
const middle = parseInt((leftInferiorLimit + rightUpperLimit) / 2);
if (key === orderedVector[middle]) {
return middle;
}
if (leftInferiorLimit >= rightUpperLimit) {
return -1;
}
else if (key > orderedVector[middle]) {
return this.recursive(key, orderedVector, middle + 1, rightUpperLimit);
}
else {
return this.recursive(key, orderedVector, leftInferiorLimit, middle - 1);
}
}
}
const vector = [2, 4, 5, 32, 73];
console.log(BinarySearch.iterative(73, vector)); //out: 4
console.log(BinarySearch.recursive(32, vector, 0, vector.length - 1)); //out: 3