이진탐색

def binary_search(element, some_list):
    # 여기에 코드를 작성하세요
    start_idx= 0
    end_idx= len(some_list)-1
    
    while not start_idx > end_idx:
        mid_idx = (start_idx+end_idx)//2
        if element == some_list[mid_idx]:
            return mid_idx
        elif element < some_list[mid_idx]:
            end_idx = mid_idx-1
        else:
            start_idx = mid_idx+1
    
print(binary_search(2, [2, 3, 5, 7, 11]))
print(binary_search(0, [2, 3, 5, 7, 11]))
print(binary_search(5, [2, 3, 5, 7, 11]))
print(binary_search(3, [2, 3, 5, 7, 11]))
print(binary_search(11, [2, 3, 5, 7, 11]))