Skip to content

Commit 775add1

Browse files
binary search in js
1 parent 95ec9fb commit 775add1

File tree

2 files changed

+71
-2
lines changed

2 files changed

+71
-2
lines changed

README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
88
|-------------------------------------|-------|------|--------|----|------|------------|--------|
99
| [Algoritmo Dijkstra][1] | [C/C++](/src/c/AlgoritmoDijkstra.c) | Java | Python | Go | Ruby | [Javascript](src/javascript/AlgoritmoDijkstra.js) | Pascal |
1010
| [Algoritmo Floyd Warshall][2] | [C/C++](/src/c/AlgoritmoFloydWarshall.c) | Java | Python | Go | Ruby | Javascript | Pascal |
11-
| [Busca Binária][5] | [C/C++](/src/c/BinarySearch.cpp) | Java | [Python](/src/python/busca_binaria.py) | Go | [Ruby](/src/ruby/BuscaBinaria.rb) | Javascript | [Pascal](/src/pascal/busca-binaria.pas) |
11+
| [Busca Binária][5] | [C/C++](/src/c/BinarySearch.cpp) | Java | [Python](/src/python/busca_binaria.py) | Go | [Ruby](/src/ruby/BuscaBinaria.rb) | [Javascript](/src/javascript/BinarySearch.js) | [Pascal](/src/pascal/busca-binaria.pas) |
1212
| [Busca em Grafos][6] | [C/C++](/src/c/BuscaEmGrafo.c) | Java | Python | Go | Ruby | Javascript | Pascal |
1313
| [Busca Sequencial][7] | C/C++ | Java | [Python](/src/python/busca_sequencial.py) | Go | [Ruby](/src/ruby/BuscaSequencial.rb) | [Javascript](/src/javascript/BuscaLinear.js) | Pascal |
1414
| [Busca Sequencial Recursiva][8] | C/C++ | Java | [Python](/src/python/busca_sequencial_recursiva.py) | Go | Ruby | Javascript | Pascal |
@@ -84,7 +84,7 @@ Se você tem dúvida de como contribuir, dê uma olhada no arquivo [CONTRIBUTING
8484
[2]: https://pt.wikipedia.org/wiki/Algoritmo_de_Floyd-Warshall
8585
[3]: https://pt.wikipedia.org/wiki/%C3%81rvore_bin%C3%A1ria_de_busca
8686
[4]: https://pt.wikipedia.org/wiki/%C3%81rvore_bin%C3%A1ria
87-
[5]: https://www.ime.usp.br/~pf/analise_de_algoritmos/aulas/binarysearch.html
87+
[5]: https://pt.wikipedia.org/wiki/Pesquisa_bin%C3%A1ria
8888
[6]: http://www.professeurs.polymtl.ca/michel.gagnon/Disciplinas/Bac/Grafos/Busca/busca.html
8989
[7]: https://pt.wikipedia.org/wiki/Busca_linear
9090
[8]: https://pt.wikipedia.org/wiki/Busca_linear

src/javascript/BinarySearch.js

Lines changed: 69 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,69 @@
1+
class BinarySearch {
2+
iterative(key, orderedVector) {
3+
if (!(orderedVector instanceof Array) && typeof key !== 'number')
4+
throw new Error("it is necessary to validate the types of data reported.");
5+
6+
let inferiorLimit = 0; // first vector index in Javascript
7+
let upperLimit = orderedVector.length - 1; // last index of the vector in Javascript
8+
let middle;
9+
10+
while (inferiorLimit <= upperLimit) {
11+
middle = parseInt((inferiorLimit + upperLimit) / 2);
12+
13+
if (key === orderedVector[middle])
14+
return middle;
15+
else if (key < orderedVector[middle])
16+
upperLimit = middle - 1;
17+
else
18+
inferiorLimit = middle + 1;
19+
}
20+
21+
return -1; // Not found
22+
}
23+
24+
recursive(key, orderedVector, leftInferiorLimit, rightUpperLimit) {
25+
if (typeof key !== 'number' && !(orderedVector instanceof Array) && typeof leftInferiorLimit !== 'number' && typeof rightUpperLimit !== 'number')
26+
throw new Error("it is necessary to validate the types of data reported.");
27+
28+
const middle = parseInt((leftInferiorLimit + rightUpperLimit) / 2);
29+
30+
if (key === orderedVector[middle])
31+
return middle;
32+
33+
if (leftInferiorLimit >= rightUpperLimit)
34+
return -1;// Not found
35+
else if (key > orderedVector[middle]) // 10 < 9
36+
return this.recursive(key, orderedVector, middle + 1, rightUpperLimit);
37+
else
38+
return this.recursive(key, orderedVector, leftInferiorLimit, middle - 1);
39+
}
40+
}
41+
42+
function main() {
43+
let vector = []
44+
45+
for (let index = 1; index <= 50; index++)
46+
vector.push(index)
47+
48+
const instance = new BinarySearch();
49+
const wantedValue = 1;
50+
try {
51+
const resultIterative = instance.iterative(wantedValue, vector);
52+
const resultRecursive = instance.recursive(wantedValue, vector, 0, vector.length);
53+
54+
const getMessage = value => {
55+
if (value === -1)
56+
return "Value not found";
57+
else
58+
return `Value found in position ${value}`;
59+
}
60+
61+
console.log(`Wanted Value -> ${wantedValue}`);
62+
console.log(`Iterative -> ${getMessage(resultIterative)}`);
63+
console.log(`Recursive -> ${getMessage(resultRecursive)}`);
64+
} catch (error) {
65+
console.error(error.message);
66+
}
67+
}
68+
69+
main();

0 commit comments

Comments
 (0)