pseudocódigo para ejemplo de código de algoritmo de búsqueda binaria

Hola, encontramos la solución a lo que andabas buscando, desplázate y la hallarás aquí.

Ejemplo: implementar una búsqueda binaria de un ordenado array de enteros usando pseudo-código.

# Here's the pseudocode for binary search, modified for searching in an array. The inputs are the array, which we call array; the number n of elements in array; and target, the number being searched for. The output is the index in array of target:1.Let min =0 and max = n-1.2.Compute guess as the average of max and min, rounded down (so that it is an integer).3.If array[guess] equals target, then stop. You found it!Return guess.4.If the guess was too low, that is, array[guess]< target, then set min = guess +1.5.Otherwise, the guess was too high. Set max = guess -1.6.Go back tostep2.

---

---

Utiliza Nuestro Buscador