Pythonで二分探索 - Qiita

def binary_search(src, target_value): result = False lower_index = 0 higher_index = len(src)-1 while True: dst = src[lower_index:higher_index+1] medium_index = (lower_index + higher_index) // 2 if src[medium_index] == target_value: result = True break if (higher_index - lower_index) == 1: break if target_value >= dst[medium_index]: lower_index = medium_index else: higher_index = medium_index retur