Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- a = [1, 2, 5, 10, 34, 55, 60, 72] #Бинарный правый поиск. Берем уже отсортированный массив чисел
- left = -1
- right = len(a)
- x = int(input())
- while left < right - 1:
- mid = (left + right) // 2
- if a[mid] > x:
- right = mid
- else:
- left = mid
- if left >= 0 and a[left] == x:
- print('Индекс элемента равен',left)
- if left != x:
- print('Элемент не найден')
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement