hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-09-20 07:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add es-ES translation to search/binary-search (#893)

Browse Source
This commit is contained in:
Enzo 2024-07-13 15:27:09 -04:00 committed by GitHub
parent 351a63a59f
commit 471e6d0791
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
3 changed files with 37 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
src/algorithms/search/binary-search/README.es-ES.md Normal file
View File

@ -0,0 +1,27 @@
# Búsqueda binaria
_Lea esto en otros idiomas:_
[English](README.md)
[Português brasileiro](README.pt-BR.md).
En informática, la búsqueda binaria, también conocida como búsqueda de medio intervalo
búsqueda, búsqueda logarítmica, o corte binario, es un algoritmo de búsqueda
que encuentra la posición de un valor objetivo dentro de una matriz
ordenada. La búsqueda binaria compara el valor objetivo con el elemento central
de la matriz; si son desiguales, se elimina la mitad en la que
la mitad en la que no puede estar el objetivo se elimina y la búsqueda continúa
en la mitad restante hasta que tenga éxito. Si la búsqueda
termina con la mitad restante vacía, el objetivo no está
en la matriz.
![Búsqueda binaria](https://upload.wikimedia.org/wikipedia/commons/8/83/Binary_Search_Depiction.svg)
## Complejidad
**Complejidad de tiempo**: `O(log(n))` - ya que dividimos el área de búsqueda en dos para cada
siguiente iteración.
## Referencias
- [Wikipedia](https://en.wikipedia.org/wiki/Binary_search_algorithm)
- [YouTube](https://www.youtube.com/watch?v=P3YID7liBug&index=29&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)

17
src/algorithms/search/binary-search/README.md
View File

@ -2,15 +2,16 @@
_Read this in other languages:_ _Read this in other languages:_
[Português brasileiro](README.pt-BR.md). [Português brasileiro](README.pt-BR.md).
[Español](README.es-ES.md).
In computer science, binary search, also known as half-interval In computer science, binary search, also known as half-interval
search, logarithmic search, or binary chop, is a search algorithm search, logarithmic search, or binary chop, is a search algorithm
that finds the position of a target value within a sorted that finds the position of a target value within a sorted
array. Binary search compares the target value to the middle array. Binary search compares the target value to the middle
element of the array; if they are unequal, the half in which element of the array; if they are unequal, the half in which
the target cannot lie is eliminated and the search continues the target cannot lie is eliminated and the search continues
on the remaining half until it is successful. If the search on the remaining half until it is successful. If the search
ends with the remaining half being empty, the target is not ends with the remaining half being empty, the target is not
in the array. in the array.
![Binary Search](https://upload.wikimedia.org/wikipedia/commons/8/83/Binary_Search_Depiction.svg) ![Binary Search](https://upload.wikimedia.org/wikipedia/commons/8/83/Binary_Search_Depiction.svg)

1
src/algorithms/search/binary-search/README.pt-BR.md
View File

@ -2,6 +2,7 @@
_Leia isso em outras línguas:_ _Leia isso em outras línguas:_
[english](README.md). [english](README.md).
[Español](README.es-ES.md).
Em ciência da computação, busca binária, também conhecida como busca de meio-intervalo, busca logarítmica ou corte binário, é um algoritmo de pesquisa Em ciência da computação, busca binária, também conhecida como busca de meio-intervalo, busca logarítmica ou corte binário, é um algoritmo de pesquisa
que encontra a posição de um elemento alvo dentro de um que encontra a posição de um elemento alvo dentro de um