def binary_search(array, element):
average = 0
max = len(array) - 1
min = 0
while min <= max:
average = (max + min) // 2;
if array[average] == element:
print("El elemento " , element , " esta en la posición : " , (average + 1))
return
elif array[average] > element:
max = average - 1
else:
min = average + 1
print("El elemento no se encuentra");
array = [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ]
print("Este es el array de valores ")
print(array)
binary_search(array, 1) # 1
binary_search(array, 2) # 2
binary_search(array, 3) # 3
binary_search(array, 4) # 4
binary_search(array, 5) # 5
binary_search(array, 6) # 6
binary_search(array, 7) # 7
binary_search(array, 8) # 8
binary_search(array, 9) # 9
binary_search(array, 10) # 10
binary_search(array, 23) # El elemento no se encuentra
Comentarios sobre la versión: 20181230 (0)
No hay comentarios