Commit471e6d0

authored

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

1 parent351a63a commit471e6d0Copy full SHA for 471e6d0

File tree

+37

-8

lines changed

+37

-8

lines changed

Lines changed: 27 additions & 0 deletions

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

Lines changed: 9 additions & 8 deletions

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

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,7 @@`
`2`	`2`
`3`	`3`	`_Leia isso em outras línguas:_`
`4`	`4`	`[english](README.md).`
	`5`	`+[Español](README.es-ES.md).`
`5`	`6`
`6`	`7`	`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`
`7`	`8`	`que encontra a posição de um elemento alvo dentro de um`

Comments

(0)